A greedy reduction algorithm for setup optimization

DOI10.1016/0166-218X(92)90297-NMaRDI QIDQ1183348zbMATH OpenOpenAlexFDO

Authors U. Faigle, Rainer Schrader

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)

Recommendations

• Algorithmic Approaches to Setup Minimization
• A setup heuristic for interval orders
• Setup optimization problems with matroid structure
• Minimizing setups in ordered sets of fixed width
• On a setup optimization problem for interval orders

Cites work

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

Cited in

(2)

• Algorithmic Approaches to Setup Minimization
• A setup heuristic for interval orders

This page was built for publication: A greedy reduction algorithm for setup optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1183348)