On the number of iterations of local improvement algorithms
- 31 December 1983
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 2 (5), 231-238
- https://doi.org/10.1016/0167-6377(83)90030-5
Abstract
No abstract availableFunding Information
- National Science Foundation (ECS-8012974, MCS-7926009, MCS76-81259)
- U.S. Department of Energy (AM03-76SF00326, C-0267)
- Army Research Office (DAS29-79-C-0110)
- Georgia Institute of Technology
This publication has 9 references indexed in Scilit:
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex MethodMathematics of Operations Research, 1982
- Polynomial Local Improvement Algorithms in Combinatorial Optimization.Published by Defense Technical Information Center (DTIC) ,1981
- Computational complexity of LCPs associated with positive definite symmetric matricesMathematical Programming, 1979
- Some Examples of Difficult Traveling Salesman ProblemsOperations Research, 1978
- On the Complexity of Local Search for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- Convex Location Problems on Tree NetworksOperations Research, 1976
- Efficient Heuristic Procedures for Integer Linear Programming with an InteriorOperations Research, 1969
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965