Survivable networks, linear programming relaxations and the parsimonious property
- 1 June 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 60 (1-3) , 145-166
- https://doi.org/10.1007/bf01580607
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- A note on the prize collecting traveling salesman problemMathematical Programming, 1993
- When trees collidePublished by Association for Computing Machinery (ACM) ,1991
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network DesignOperations Research, 1989
- An integer linear programming approach to the steiner problem in graphsNetworks, 1980
- Heuristic analysis, linear programming and branch and boundPublished by Springer Nature ,1980
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957