Approximate Local Search in Combinatorial Optimization

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 580-589

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; LINEAR PROGRAMMING; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

COMBINATORIAL OPTIMIZATION; NEIGHBORHOOD FUNCTION; STANDARD LOCAL SEARCH;

COMBINATORIAL MATHEMATICS;

EID: 1842487472     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Ahuja, R., Ö. Ergun, J. Orlin, and A. Punnen (2002). A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123, 75-102.
2. Arkin, E. and R. Hassin (1998). On local search for weighted k-set packing. Mathematics of Operations Research 23, 640-648.
3. Arkin, E., R. Hassin, S. Rubinstein, and M. Sviridenko (2002). Approximations for maximum transportation problem with permutable supply vector and other capacitated star packing problems. In M. Penttonen and E. Meineche Schmidt (Eds.), Algorithm Theory - SWAT 2002, Volume 2368 of Lecture Notes in Computer Science, pp. 280-287. Springer. Proceedings of the 8th Scandinavian Workshop on Algorithm Theory.
4. Ausiello, G. and M. Protasi (1995). Local search, reducibility and approximability of NP-optimization problems. Information Processing Letters 54, 73-79.
5. Chandra, B., H. Karloff, and C. Tovey (1999), New results on the old k-opt algorithm for the traveling salesman problem. SIAM Journal on Computing 28, 1998-2029.
6. Fischer, S. (1995). A note on the complexity of local search problems. Information Processing Letters 53, 69-75.
7. Garey, M. and D. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman.
8. Grötschel, M. and L. Lovász (1995). Combinatorial optimization. In R. Graham, M. Grötschel, and L. Lovász (Eds.), Handbook of Combinatorics, Volume II, Chapter 28, pp. 1541-1597. North-Holland.
9. Johnson, D., C. Papadimitriou, and M. Yannakakis (1988). How easy is local search? Journal of Computer and System Sciences 37, 79-100.
10. Khanna, S., R. Motwani, M. Sudan, and U. Vazirani (1998). On syntactic versus computational views of approximability. SIAM Journal on Computing 28, 164-191.
11. Klauck, H. (1996). On the hardness of global and local approximation. In R. Karlsson (Ed.), Algorithm Theory - SWAT '96, Volume 1097 of Lecture Notes in Computer Science, pp. 88-99. Springer. Proceedings of the 5th Scandinavian Workshop on Algorithm Theory.
12. Krentel, M. (1989). Structure in locally optimal solutions. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Los Alamitos, CA, pp. 216-221. IEEE.
13. Krentel, M. (1990). On finding and verifying locally optimal solutions. SIAM Journal on Computing 19, 742-749.
14. Lueker, G. (1976). Manuscript, Department of Computer Science, Princeton University, Princeton, NJ.
15. Orlin, J., A. Punnen, and A. Schulz (2003, July). Approximate local search in combinatorial optimization. Working Paper 4325-03, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA. http://ssrn.com/abstract=423560.
16. Papadimitriou, C. (1992). The complexity of the Lin-Kernighan heuristic for the traveling salesman problem. SIAM Journal on Computing 21, 450-465.
17. Papadimitriou, C. and K. Steiglitz (1977). On the complexity of local search for the traveling salesman problem. SIAM Journal on Computing 6, 76-83.
18. Radzik, T. (1993). Parametric flows, weighted means of cuts, and fractional combinatorial optimization. In P. Pardalos (Ed.), Complexity in Numerical Optimization, pp. 351-386. World Scientific.
19. Schäffer, A. and M. Yannakakis (1991). Simple local search problems that are hard to solve. SIAM Journal on Computing 20, 56-87.
20. Schulz, A. and R. Weismantel (1999). An oracle-polynomial time augmentation algorithm for integer programming. In Proceedings of the 10th Annual Symposium on Discrete Algorithms, Baltimore, MD, pp. 967-968. ACM/SIAM.
21. Schulz, A. and R. Weismantel (2002). The complexity of generic primal algorithms for solving general integer programs. Mathematics of Operations Research 27, 681-692.
22. Schulz, A., R. Weismantel, and G. Ziegler (1995). 0/1-integer programming: Optimization and augmentation are equivalent. In P. Spirakis (Ed.), Algorithms - ESA '95, Volume 979 of Lecture Notes in Computer Science, pp. 473-483. Springer. Proceedings of the 3rd Annual European Symposium on Algorithms.
23. Schulz, A., R. Weismantel, and G. Ziegler (1996). Unpublished Manuscript.
24. Yannakakis, M. (1997). Computational complexity. In E. Aarts and J. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization, Chapter 2, pp. 19-55.