A comparison of algorithms for minimizing bumps in linear extensions of partial orders
From MaRDI portal
(Redirected from Publication:1820992)
The notion of bumps deals with a property of linear extensions of a partial order. Let P define a partial order on a set X and let L define a linear extension of P. A bump occurs whenever elements x and y in X are adjacent in both P and L. Heuristics have been developed to construct linear extensions of a partial order that should tend to minimize bumps. This paper presents results of a computer simulation study that compares the performance of bump minimizing algorithms.
Recommendations
Cites work
- An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
- scientific article; zbMATH DE number 3877241 (Why is no real title available?)
- Minimizing bumps in linear extensions of ordered sets
- On methods for generating random partial orders
- “Problem specialization” in mechanical decision processes
Cited in
(7)- Minimizing bumps in linear extensions of ordered sets
- Computing the bump number is easy
- Minimizing bumps for posets of width two
- Minimizing bumps in ordered sets by substitution decomposition
- Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
- scientific article; zbMATH DE number 27746 (Why is no real title available?)
- The connection between the bump number problem and flow-shop scheduling with precedence constraints
This page was built for publication: A comparison of algorithms for minimizing bumps in linear extensions of partial orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820992)
