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

DOI10.1016/0167-6377(87)90022-8zbMATH Open0615.90007OpenAlexW2085284321MaRDI QIDQ1820992FDOQ1820992

Authors: William V. Gehrlein, Peter 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

Recommendations

• Minimizing bumps in linear extensions of ordered sets
• Minimizing bumps in ordered sets by substitution decomposition
• Minimizing bumps for posets of width two
• Computing the bump number is easy
• Computing the bump number with techniques from two-processor scheduling

zbMATH Keywords

bumpsHeuristicslinear extensions of a partial order

Mathematics Subject Classification ID

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

Cites Work

• On methods for generating random partial orders
• An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
• Minimizing bumps in linear extensions of ordered sets
• Title not available (Why is that?)
• “Problem specialization” in mechanical decision processes

Cited In (7)

• Title not available (Why is that?)
• Minimizing bumps in linear extensions of ordered sets
• Computing the bump number is easy
• Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
• The connection between the bump number problem and flow-shop scheduling with precedence constraints
• Minimizing bumps in ordered sets by substitution decomposition
• Minimizing bumps for posets of width two

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)