A greedy reduction algorithm for setup optimization

DOI10.1016/0166-218X(92)90297-NzbMath0742.06001OpenAlexW2141921474MaRDI QIDQ1183348

Rainer Schrader, Ulrich Faigle

Publication date: 28 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90297-n

zbMATH Keywords

reduction algorithmbipartite Dilworth optimal ordersgeneral ordered setssetup optimizationweakly cycle-free orders

Mathematics Subject Classification ID

Partial orders, general (06A06) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Cites Work

• NP-completeness properties about linear extensions
• Characterizations of strongly chordal graphs
• A decomposition theorem for partially ordered sets
• Minimizing Setups for Cycle-Free Ordered Sets