Some Partial Orders Related to Boolean Optimization and the Greedy Algorithm
- 1 January 1977
- book chapter
- Published by Elsevier
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Matroid intersection algorithmsMathematical Programming, 1975
- Faces for a linear inequality in 0–1 variablesMathematical Programming, 1975
- A greedy algorithm for solving a certain class of linear programmesMathematical Programming, 1973
- Matroids and the greedy algorithmMathematical Programming, 1971
- Optimal assignments in an ordered set: An application of matroid theoryJournal of Combinatorial Theory, 1968
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956