Lagrangean Tabu search

Operations Research/ Computer Science Interfaces Series

Volumn 15, Issue , 2002, Pages 379-397

  Grünert, Tore ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84888777025     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4615-1507-4     Document Type: Article

References (23)

1. B.M. Baker and J. Sheasby. Accelerating the Convergence of Subgradient Optimisation. European Journal of Operational Research, 117:136-144, 1999.
2. J Barcelo, E Fernandez, and KO Jørnsten. Computational Results From a New Lagrangean Relaxation Algorithm for the Capacitated Plant Location Problem. European Journal of Operational Research, 53:38-45, 1991
3. JE Beasley. An Algorithm for Solving Large Capacitated Warehouse Location Problems. European Journal of Operational Research, 33:314-325,1988.
4. J.E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society, 41:1069-1072, 1991.
5. J .E. Beasley. Lagrangean Heuristics for Location Problems. European Journal of Operational Research, 65:383-399, 1993.
6. J.E. Beasley. Lagrangean Relaxation. In: Modern Heuristic Techniques for Combinatorial Problems, C.R.R. Reeves, editor, pages 243-303. Blackwell, 1993.
7. A. Caprara, M. Fischetti, and P. Toth. A Heuristic Algorithm for the Set Covering Problem. Operations Research, 47:730-743, 1999.
8. G. Cornuejols, R. Sridharan, and J.M. Thizy. A Comparison of Heuristics and Different Relaxations for the Capacitated Plant Location Problem. European Journal of Operational Research, 50:280-297, 1991.
9. M.L. Fisher. The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science, 26: 1-17, 1981.
10. A.M. Geoffrion. Lagrangean Relaxation for Integer Programming. Mathematical Programming Study, 2:82-114, 1974.
11. F. Glover. Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research, 5:533-549, 1986.
12. F. Glover and D. Klingman. Layering Strategies for Creating Exploitable in Linear and Integer Programs. Mathematical Programming, 40:165-181, 1988.
13. F. Glover and M. Laguna. Tabu Search. Kluwer, 1997.
14. T. Griinert. Multi-Level Sequence-Dependent Dynamic Lotsizing and Scheduling. Shaker, Aachen, 1998.
15. M. Guignard and S. Kim. Lagrangean Decomposition: A Model Yielding Stronger Lagrangean Bounds. Mathematical Programming, 39:215-228, 1987.
16. M. Held and R.M. Karp. The Traveling-Salesman Problem and Minimum Spanning Trees. Operations Research, 21:1138-1162, 1970.
17. J.P. Hiriart-Urruty and C. Lemarechal. Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods. Springer, 1993.
18. nog Inc. Cplex Callable Library 6.5.2. Reference Manual, 1999.
19. S.K. Jacobsen. Heuristics for the Capacitated Plan Location Model. European Journal of Operational Research, 12:253-261, 1988.
20. B.M. Khumawala. An Efficient Heuristic Procedure for the Capacitated Warehouse Location Problem. Naval Research Logistics Quarterly, 21:609-623, 1974.
21. A.A. Kuehn and M.J. Hamburger. A Heuristic Program for Locating Warehouses. Management Science, 9:643-666, 1963.
22. G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. Wiley, 1988.
23. R. Sridharan. A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints. Journal of the Operational Research Society, 42:579-585, 1991.