A comparison of algorithms for minimizing bumps in linear extensions of partial orders

DOI10.1016/0167-6377(87)90022-8zbMath0615.90007OpenAlexW2085284321MaRDI QIDQ1820992

William V. Gehrlein, Peter C. Fishburn

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90022-8

zbMATH Keywords

Heuristicsbumpslinear extensions of a partial order

Mathematics Subject Classification ID

Partial orders, general (06A06) Individual preferences (91B08)

Related Items (4)

Minimizing bumps in linear extensions of ordered sets ⋮ Computing the bump number is easy ⋮ Minimizing bumps in ordered sets by substitution decomposition ⋮ The connection between the bump number problem and flow-shop scheduling with precedence constraints

Cites Work

• Unnamed Item
• Minimizing bumps in linear extensions of ordered sets
• On methods for generating random partial orders
• “Problem specialization” in mechanical decision processes
• An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques

This page was built for publication: A comparison of algorithms for minimizing bumps in linear extensions of partial orders