Algorithmic Approaches to Setup Minimization
- 1 November 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (4) , 954-965
- https://doi.org/10.1137/0214068
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A Construction for Strongly Greedy Ordered SetsPublished by Springer Nature ,1984
- A Fast Algorithm for the Decomposition of Graphs and PosetsMathematics of Operations Research, 1983
- Minimizing Setups for Ordered Sets: A Linear Algebraic ApproachSIAM Journal on Algebraic Discrete Methods, 1983
- Optimal linear extensions by interchanging chainsProceedings of the American Mathematical Society, 1983
- Minimizing setups for cycle-free ordered setsProceedings of the American Mathematical Society, 1982
- Nombre de sauts et graphes série-parallèlesRAIRO. Informatique théorique, 1979
- Ordres "C.A.C."Fundamenta Mathematicae, 1973
- Maximal chains and antichainsFundamenta Mathematicae, 1969
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950
- Sur l'extension de l'ordre partielFundamenta Mathematicae, 1930