Worst-Case Analysis of Network Design Problem Heuristics
- 1 March 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 1 (1) , 51-63
- https://doi.org/10.1137/0601008
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The complexity of the network design problemNetworks, 1978
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- 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
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- An Algorithm for the Discrete Network Design ProblemTransportation Science, 1975
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- Optimal Network Problem: A Branch-and-Bound AlgorithmEnvironment and Planning A: Economy and Space, 1973
- A Computational Approach to the Selection of an Optimal NetworkManagement Science, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972