Geometric Methods in Combinatorial Optimization
- 1 January 1984
- book chapter
- Published by Elsevier
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Brick decompositions and the matching rank of graphsCombinatorica, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- On linear characterizations of combinatorial optimization problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Matroid IntersectionAnnals of Discrete Mathematics, 1979
- Packing rooted directed cuts in a weighted directed graphMathematical Programming, 1974
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- A note on two problems in connexion with graphsNumerische Mathematik, 1959