Minimum-weight two-connected spanning networks
Open Access
- 1 January 1990
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 46 (2), 153-171
- https://doi.org/10.1007/bf01585735
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- 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
- On the worst‐case performance of some algorithms for the asymmetric traveling salesman problemNetworks, 1982
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- Tight bounds for christofides' traveling salesman heuristicMathematical Programming, 1978
- Augmentation ProblemsSIAM Journal on Computing, 1976
- The steiner problem in graphsNetworks, 1971
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman ProblemOperations Research, 1959