A brief introduction to exact, approximation, and heuristic algorithms for solving hard combinatorial optimization problems

International Conference on Transparent Optical Networks

Volumn , Issue , 2014, Pages

  Festa, P ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

Approximate solutions; Exact solution; Hard combinatorial optimization; Metaheuristics

Indexed keywords

COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; SIMULATED ANNEALING; TABU SEARCH; TRANSPARENT OPTICAL NETWORKS;

APPROXIMATE SOLUTION; APPROXIMATION TECHNIQUES; COMBINATORIAL OPTIMIZATION PROBLEMS; EXACT SOLUTION; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; META HEURISTIC ALGORITHM; META HEURISTICS; VARIABLE NEIGHBORHOOD SEARCH;

APPROXIMATION ALGORITHMS;

EID: 84906739479     PISSN: None     EISSN: 21627339     Source Type: Conference Proceeding    
DOI: 10.1109/ICTON.2014.6876285     Document Type: Conference Paper

References (57)

1. R.K. Ahuja, O. Ergun, J.B. Orlin, and A.P. Punnen. A survey of very large-scale neighborhood search techniques. Discrete Appl. Math., 123:75-102, 2002.
2. R.K. Ahuja, J.B. Orlin, and D. Sharma. Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Mathematical Programming, 91:71-97, 2001.
3. R.K. Ahuja, J.B. Orlin, and A. Tiwari. A greedy genetic algorithm for the quadratic assignment problem. Computers and Operations Research, 27:917-934, 2000.
4. A.M. Alvarez, J.L. Gonzalez-Velarde, and K. De Alba. GRASP embedded scatter search for the multicommodity capacitated network design problem. J. of Heuristics, 11:233-257, 2005.
5. E.B. Baum. Iterated descent: A better algorithm for local search in combinatorial optimization problems. Technical report, California Institute of Technology, 1986.
6. R. Bellman. Dynamic programming. Princeton University Press, 1957.
7. J.D. Beltrán, J.E. Calderón, R.J. Cabrera, J.A.M. Pérez, and J.M. Moreno-Vega. GRASP/VNS hybrid for the strip packing problem. In Proceedings of Hybrid Metaheuristics (HM2004), pages 79-90, 2004.
8. D.P. Bertsekas. Dynamic Programming and Optimal Control, volume I. Athena Scientific, 3rd edition edition, 2005.
9. S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro. Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks, 38:50-58, 2001.
10. E.W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1(1):269-271, 1959.
11. M. Dorigo and T. Stutzle. Ant Colony Optimization. MIT Press, 2004.
12. D. Hochbaum (editor). Approximation algorithms for NP-hard problems. PWS Publishing, 1996.
13. T.A. Feo and M.G.C. Resende. A probabilistic heuristic for a computationally dificult set covering problem. Operations Research Letters, 8:67-71, 1989.
14. T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search procedures. J. of Global Optimization, 6:109-133, 1995.
15. P. Festa, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro. Randomized heuristics for the MAX-CUT problem. Optimization Methods and Software, 7:1033-1058, 2002.
16. P. Festa and M. G. C. Resende. An annotated bibliography of GRASP-Part I: algorithms. International Transactions in Operational Research, 16(1):1-24, 2009.
17. P. Festa and M. G. C. Resende. An annotated bibliography of GRASP-Part II: applications. International Transactions in Operational Research, 16(2):131-172, 2009.
18. P. Festa and M.G.C. Resende. GRASP: An annotated bibliography. In C.C. Ribeiro and P. Hansen, editors, Essays and Surveys on Metaheuristics, pages 325-367. Kluwer Academic Publishers, 2002.
19. P. Festa and M.G.C. Resende. Hybrid GRASP heuristics. Studies in Computational Intelli-gence, 203:75-100, 2009.
20. P. Festa and M.G.C. Resende. GRASP: Basic components and enhancements. Telecommuni-cation Systems, 46(3):253-271, 2011.
21. P. Festa and M.G.C. Resende. Hybridizations of GRASP with path-relinking. Studies in Computational Intelligence, 434:135-155, 2013.
22. M.R. Garey and D.S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, New York, 1979.
23. F. Glover. Tabu search-Part I. ORSA J. on Computing, 1:190-206, 1989.
24. F. Glover. Tabu search-Part II. ORSA J. on Computing, 2:4-32, 1990.
25. F. Glover. Tabu search and adaptive memory programing-Advances, applications and challenges. In R.S. Barr, R.V. Helgason, and J.L. Kennington, editors, Interfaces in Computer Science and Operations Research, pages 1-75. Kluwer, 1996.
26. F. Glover. Multi-start and strategic oscillation methods-Principles to exploit adaptive memory. In M. Laguna and J.L. Gonzáles-Velarde, editors, Computing Tools for Modeling, Opti-mization and Simulation: Interfaces in Computer Science and Operations Research, pages 1-24. Kluwer, 2000.
27. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
28. F. Glover, M. Laguna, and R. Martí. Fundamentals of scatter search and path relinking. Control and Cybernetics, 39:653-684, 2000.
29. F. Glover, M. Laguna, and R. Martí. Scatter Search. In A. Ghosh and S. Tsutsui, editors, Advances in Evolutionary Computation: Theory and Applications, pages 519-537. Kluwer Academic Publishers, 2003.
30. D.E Goldberg. Genetic algorithms in search, optimization and machine learning. Addison-Wesley, 1989.
31. P. Hansen and N. Mladenović. An introduction to variable neighborhood search. In S. Voss, S. Martello, I. H. Osman, and C. Roucairol, editors, Meta-heuristics, Advances and trends in local search paradigms for optimization, pages 433-458. Kluwer Academic Publishers, 1998.
32. P. Hansen and N. Mladenović. Developments of variable neighborhood search. In C.C. Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, pages 415-439. Kluwer Academic Publishers, 2002.
33. J.P. Hart and A.W. Shogan. Semi-greedy heuristics: An empirical study. Operations Research Letters, 6:107-114, 1987.
34. J.H. Holland. Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, Ann Arbor, Mich., USA, 1975.
35. T. Ibaraki. Enumerative approaches to combinatorial optimization. Annals of Operations Research, 10:3-342, 1988.
36. S. Kirkpatrick. Optimization by simulated annealing: Quantitative studies. J. of Statistical Physics, 34:975-986, 1984.
37. J.R. Koza, F.H. Bennett III, D. Andre, and M.A. Keane. Genetic Programming III, Dar-winian Invention and Problem Solving. Morgan Kaufmann Publishers, 1999.
38. M. Laguna. Scatter Search. In P.M. Pardalos and M.G.C. Resende, editors, Handbook of Applied Optimization, pages 183-193. Oxford University Press, 2002.
39. M. Laguna and R. Martí. Scatter Search: Methodology and Implementations in C. Kluwer, 2003.
40. E.L. Lawler and D.E. Wood. Branch-and-Bound Methods: A Survey. Operations Research, 14(4):699-719, 1966.
41. H.R. Lourenço, O.C. Martin, and T. Stützle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 321-353. Kluwer Academic Publishers, 2003.
42. M. Minoux. Mathematical Programming: Theory and Algorithms. Wiley, 1986.
43. N. Mladenović and P. Hansen. Variable neighborhood search. Computers and Operations Research, 24:1097-1100, 1997.
44. G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. Wiley, 1988.
45. I.H. Osman and G. Laporte. Metaheuristics: A bibliography. Annals of Operations Research, 63:513, 1996.
46. C.H. Papadimitriou and K. Steiglitz. Combinatorial optimization: Algorithms and complex-ity. Prentice-Hall, 1982.
47. P.M. Pardalos and M.G.C. Resende, editors. Handbook of Applied Optimization. Oxford University Press, 2002.
48. M.G.C. Resende, R. Martí, M. Gallego, and A. Duarte. GRASP and path relinking for the max-min diversity problem. Technical report, AT&T Labs Research, Florham Park, NJ-USA, 2008.
49. M.G.C. Resende and C.C. Ribeiro. Greedy randomized adaptive search procedures. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 219-249. Kluwer Academic Publishers, 2003.
50. M.G.C. Resende and C.C. Ribeiro. A hybrid heuristic for the p-median problem. J. of Heuris-tics, 10:59-88, 2004.
51. M.G.C. Resende and R.F. Werneck. A hybrid multistart heuristic for the uncapacitated facility location problem. European J. of Operational Research, 174:54-68, 2006.
52. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
53. J.F. Shapiro. Mathematical Programming: Structures and Algorithms. Wiley, 1979.
54. M. Sniedovich. Dynamic Programming: Foundations and Principles. Taylor & Francis, 2010.
55. V. Vazirani. Approximation algorithms. Springer-Verlag, 2001.
56. S. Voss, S. Martello, I.H. Osman, and C. Roucairo, editors. Meta-heuristics: Andvances and trends in local search paradigms for optimization. Kluwer, 1999.
57. D.P. Williamson and D.B. Shmoys. The Design of Approximation Algorithms. Cambridge University Press, 2011.