Approximate local search in combinatorial optimization

SIAM Journal on Computing

Volumn 33, Issue 5, 2004, Pages 1201-1214

  Orlin, James B ^a   Punnen, Abraham P ^b   Schulz, Andreas S ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF NEW BRUNSWICK   (Canada)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

0 1 integer programming; Approximation algorithms; Combinatorial optimization; Computational complexity; Local search; Neighborhood search

Indexed keywords

0/1-INTEGER PROGRAMMING; APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION (CO); LOCAL SEARCH; NEIGHBORHOOD SEARCH (NS);

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FUNCTIONS; ITERATIVE METHODS; OPTIMIZATION; POLYNOMIALS; SET THEORY; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL MATHEMATICS;

EID: 8444240829     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703431007     Document Type: Article

References (34)

1. R. K. AHUJA, Ö. ERGUN, AND A. P. PUNNEN (2002), A survey of very large-scale neighborhood search techniques, Discrete Appl. Math., 123, pp. 75-102.
2. E. M. ARKIN AND R. HASSIN (1998), On local search for weighted k-set packing, Math. Oper. Res., 23, pp. 640-648.
3. E. M. ARKIN, R. HASSIN, S. RUBINSTEIN, AND M. SVIRIDENKO (2002), Approximations for maximum transportation problem with permutable supply vector and other capacitated star packing problems, in Algorithm Theory - SWAT 2002, Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, M. Penttonen and E. Meineche Schmidt, eds., Lecture Notes in Comput. Sci. 2368, Springer, Berlin, pp. 280-287.
4. G. AUSIELLO AND M. PROTASI (1995), Local search, reducibility and approximability of NP-optimization problems, Inform. Process. Lett., 54, pp. 73-79.
5. B. CHANDRA, H. KARLOFF, AND C. TOVEY (1999), New results on the old k-opt algorithm for the traveling salesman problem, SIAM J. Comput., 28, pp. 1998-2029.
6. W. J. COOK, W. H. CUNNINGHAM, W. R. PULLEYBLANK, AND A. SCHRIJVER (1998), Combinatorial Optimization, John Wiley & Sons, New York.
7. V. DEINEKO AND G. WOEGINGER (2000), A study of exponential neighborhoods for the traveling salesman problem and the quadratic assignment problem, Math. Program., 87, pp. 519-542.
8. S. T. FISCHER (1995), A note on the complexity of local search problems, Inform. Process. Lett., 53, pp. 69-75.
9. M. R. GAHEY AND D. S. JOHNSON (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San. Francisco, CA.
10. M. GRÖTSCHEL AND L. LOVÁSZ (1995), Combinatorial optimization, Chapter 28 in Handbook of Combinatorics, Vol. II, R. Graham, M. Grötschel, and L. Lovász, eds., North-Holland, Amsterdam, pp. 1541-1597.
11. G. GUTIN, A. YEO, AND A. ZVEROVITCH (2002), Exponential neighborhoods and domination analysis for the TSP, Chapter 6 in The Traveling Salesman Problem and Its Variations, G. Gutin and A. P. Punnen, eds., Kluwer Academic, Dordrecht, The Netherlands, pp. 223-256.
12. D. S. JOHNSON, C. R. ARAGON, L. A. MCGEOCH, AND C. SCHEVON (1989), Optimization by simulated annealing: An experimental evaluation, part I (graph partitioning), Oper. Res., 37, pp. 865-892.
13. D. S. JOHNSON AND L. A. MCGEOCH (1997), The traveling salesman problem: A case study, Chapter 8 in Local Search in Combinatorial Optimization, E. Aarts and J. K. Lenstra, eds., John Wiley & Sons, Chichester, UK, pp. 215-310.
14. D. S. JOHNSON, C. H. PAPADIMITRIOU, AND M. YANNAKAKIS (1988), How easy is local search?, J. Comput. System Sci., 37, pp. 79-100.
15. B. W. KERNIGHAN AND S. LIN (1970), An efficient heuristic procedure for partitioning graphs, Bell System Tech, J., 43, pp. 291-307.
16. S. KHANNA, R. MOTWANI, M. SUDAN, AND U. VAZIRANI (1998), On syntactic versus computational views of approximability, SLAM J. Comput., 28, pp. 164-191.
17. H. KLAUCK (1996), On the hardness of global and local approximation, in Algorithm Theory -SWAT '96, Proceedings of the 5th Scandinavian Workshop on Algorithm Theory, R. Karlsson, ed., Lecture Notes in. Comput. Sci. 1097, Springer, Berlin, pp. 88-99.
18. B. KORTE AND J. VYGEN (2002), Combinatorial Optimization: Theory and Algorithms, 2nd ed., Springer, Berlin.
19. M. W. KRENTEL (1989), Structure in locally optimal solutions, in Proceedings of the 30th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, pp. 216-221.
20. M. W. KRENTEL (1990), On finding and verifying locally optimal solutions, SIAM J. Comput., 19, pp. 742-749.
21. E. LAWLER (1976), Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York.
22. É. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS, EDS. (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley & Sons, Chichester, UK.
23. S. LIN (1965), Computer solutions of the traveling salesman problem, Bell System Tech. J., 44, pp. 2245-2269.
24. C. H. PAPADIMITRIOU (1992), The complexity of the Lin-Kernighan heuristic for the traveling salesman problem, SIAM J. Comput., 21, pp. 450-465.
25. C. H. PAPADIMITRIOU AND K. STEIGLITZ (1977), On the complexity of local search for the traveling salesman problem, SIAM J. Comput., 6, pp. 76-83.
26. C. H. PAPADIMITRIOU AND K. STEIGLITZ (1982), Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ.
27. T. RADZIK (1993), Parametric flows, weighted means of cuts, and fractional combinatorial optimization, in Complexity in Numerical Optimization, P. Pardalos, ed., World Scientific, River Edge, NJ, pp. 351-386.
28. S. SAHNI AND T. GONZALEZ (1976), P-complete approximation problems, J. ACM, 23, pp. 555-565.
29. A. A. SCHÄFFER AND M. YANNAKAKIS (1991), Simple local search problems that are hard to solve, SIAM J. Comput., 20, pp. 56-87.
30. A. S. SCHULZ AND R. WEISMANTEL (1999), An oracle-polynomial time augmentation algorithm for integer programming, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, SIAM, Philadelphia, pp. 967-968.
31. A. S. SCHULZ AND R. WEISMANTEL (2002), The complexity of generic primal algorithms for solving general integer programs, Math. Oper. Res., 27, pp. 681-692.
32. A. S. SCHULZ, R. WEISMANTEL, AND G. M. ZIEGLER (1995), 0/1-integer programming: Optimization and augmentation are equivalent, in Algorithms - ESA '95, Proceedings of the 3rd Annual European Symposium on Algorithms, P. Spirakis, ed., Lecture Notes in Comput. Sci. 979, Springer, Berlin, pp. 473-483.
33. A. S. SCHULZ, R. WEISMANTEL, AND G. M. ZIEGLER (1997), An Optimization Problem Is Nine Problems, talk presented by A. S. Schulz at the 16th International Symposium on Mathematical Programming, Lausanne, Switzerland.
34. M. YANNAKAKIS (1997), Computational complexity, Chapter 2 in Local Search in Combinatorial Optimization, E. Aarts and J. K. Lenstra, eds., John Wiley & Sons, Chichester, UK, pp. 19-55.