Two-edge connected spanning subgraphs and polyhedra
- 1 March 1994
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 64 (1) , 199-208
- https://doi.org/10.1007/bf01582572
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The traveling salesman problem in graphs with some excluded minorsMathematical Programming, 1992
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout DesignOperations Research, 1988
- Send-and-Split Method for Minimum-Concave-Cost Network FlowsMathematics of Operations Research, 1987
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985
- On the relationship between the biconnectivity augmentation and travelling salesman problemsTheoretical Computer Science, 1982
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956