Setup optimization problems with matroid structure
- 1 March 1987
- journal article
- research article
- Published by Springer Nature in Order
- Vol. 4 (1) , 43-54
- https://doi.org/10.1007/bf00346652
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Algorithmic Approaches to Setup MinimizationSIAM Journal on Computing, 1985
- Greedy linear extensions to minimize jumpsDiscrete Applied Mathematics, 1985
- Jump number problem: The role of matroidsOrder, 1985
- Minimizing setups in ordered sets of fixed widthOrder, 1985
- A Graph-Theoretic Approach to the Jump-Number ProblemPublished by Springer Nature ,1985
- Minimizing completion time for a class of scheduling problemsInformation Processing Letters, 1984
- 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
- Geometries on partially ordered setsJournal of Combinatorial Theory, Series B, 1980