Some Heuristics for the 2-Poset Cover Problem
Posets are abstract models that may be considered as generating a set of linear orders, which are permutations on some base set. The problem of determining a minimum set of posets that can exactly generate a specified input set of linear orders is referred to as the Poset Cover Problem, and this pro...
Saved in:
Main Authors: | Fernandez, Proceso L, Jr, Sanchez, Gabriel Alberto A, Vergara, John Paul |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2014
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/discs-faculty-pubs/82 https://www.researchgate.net/publication/282154675_Some_Heuristics_for_the_2-Poset_Cover_Problem |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Similar Items
-
Parameterized Algorithm for the Poset Cover Problem
by: Ordanel, Ivy D., et al.
Published: (2024) -
Approximation and Computational Complexity of Some Hammock Variations of the Poset Cover Problem
by: Ordanel, Ivy, et al.
Published: (2020) -
On Finding Two Posets that Cover Given Linear Orders
by: Ordanel, Ivy, et al.
Published: (2019) -
A Polynomial Time Algorithm for the 2-Poset Cover Problem
by: Ordanel, Ivy, et al.
Published: (2021) -
An improvement heuristic for the timetabling problem
by: GUNAWAN, Aldy, et al.
Published: (2007)