Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
Author:
- 31 October 1991
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 10 (7) , 377-382
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The graph genus problem is NP-completeJournal of Algorithms, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization”Combinatorica, 1984
- A dual ascent approach for steiner tree problems on a directed graphMathematical Programming, 1984
- Odd Minimum Cut-Sets and b-MatchingsMathematics of Operations Research, 1982
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- 2-Matchings and 2-covers of hypergraphsActa Mathematica Hungarica, 1975
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965