Interval orders without odd crowns are defect optimal
- 1 March 1987
- journal article
- Published by Springer Nature in Computing
- Vol. 38 (1) , 59-69
- https://doi.org/10.1007/bf02253744
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A setup heuristic for interval ordersOperations Research Letters, 1985
- Algorithmic Approaches to Setup MinimizationSIAM Journal on Computing, 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
- Nombre de sauts et graphes série-parallèlesRAIRO. Informatique théorique, 1979