Non delayed relax-and-cut algorithms

Annals of Operations Research

Volumn 140, Issue 1, 2005, Pages 375-410

  Lucena, Abilio ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Dual bound strengthening; Lagrangian relaxation; Relax and cut; Valid constraints

Indexed keywords

EID: 28244456460     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-005-3977-1     Document Type: Article

References (50)

1. Balas, E. and N. Christofides. (1981). "A Restricted Lagrangian Approach to the Traveling Salesman Problem." Mathematical Programming 21, 19-46.
2. Barahona, F. and R. Anbil. (2000). "The Volume Algorithm: Producing Primal Solutions with the Subgradient Method." Mathematical Programming 87, 385-399.
3. Barahona, F. and L. Ladányi. (2001). "Branch and Cut Based on the Volume Algorithm: Steiner Trees in Graphs and Max-Cut." Technical report, IBM Watson Research Center.
4. Beasley, J.E. (1989). "An sst-Based Algorithm for the Steiner Problem in Graphs." Networks 19, 1-16.
5. Beasley, I.E. (1993). "Lagrangean Relaxation." In Collin Reeves (ed.), Modern Heuristics, Oxford: Blackwell Scientific Press.
6. Belloni, A. and A. Lucena. (August 2000). "A Relax and Cut Algorithm for the Traveling Salesman Problem." In 17th International Symposium on Mathematical Programming Atlanta.
7. Belloni, A. and A. Lucena. (2004). "A Lagrangian Heuristic for the Linear Ordering Problem," In M.G.C. Resende and J.P. deSousa (eds.), Metaheuristics: Computer Decision-Making, Kluwer Academic.
8. Belloni, A. and C. Sagastizábal. (2004). "Dynamic Bundle Methods." Technical report, IMPA Preprint S'erie A 2004/296.
9. Bonnans, J.F., J.Ch. Gilbert, C. Lemaréchal, and C. Sagastizábal. (1997). Optimisation Numérique: Aspects Théoriques et Pratiques. Springer Verlag.
10. Calheiros, F., A. Lucena, and C.C. deSouza. (2003). "Optimal Rectangular Partitions." Networks 41, 51-67.
11. Caccetta, L. and S.P. Hill. (2001). "A Branch and Cut Method for the Degree-Constrained Minimum Spanning Tree Problem." Networks 37(2), 74-83.
12. Chopra, S. and M.R. Rao. (1994). "The Steiner Tree Problem i: Formulations, Compositions and Extensions of Facets." Mathematical Programming 64, 209-229.
13. DaCunha, A.S. and A. Lucena. (2005). "Lower and Upper Bounds for the Degree-Constrained Minimum Spanning Tree Problem." In INOC 2005, Lisbon.
14. Dantzig, G.B., D.R. Fulkerson, and S.M Johnson. (1954). "Solution of a Large-Scale Travelling Salesman Problems." Operations Research 2, 393-410.
15. DaSilva, J.B.C. (2002). "Uma Heuristica Lagrangeana Para o Problema da Árvore Capacitada de Custo Mínimo." Master's Thesis, Programa de Engenharia de Sistemas e Computação, COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brasil.
16. deMeneses, C.N. and C.C. deSouza. (2000). "Exact Solutions of Optimal Rectangular Partitions via Integer Programming." International Journal of Computational Geometry and Applications 10(5), 477-522.
17. Duin, C.W. (1994). "Steiner's Problem in Graphs: Approximation, Reduction, Variation." PhD thesis, Institute of Actuarial Science & Economics, University of Amsterdam.
18. Edmonds, J. (1971). "Matroids and the Greedy Algorithm." Mathematical Programming 1, 127-136.
19. Escudero, L., M. Guignard, and K. Malik. (1994). "A Lagrangian Relax and Cut Approach for the Sequential Ordering with Precedence Constraints." Annals of Operations Research 50, 219-237.
20. Fisher, M.L. (1981). "The Lagrangian Relaxation Method for Solving Integer Programming Problems." Management Science 27, 1-18.
21. Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman and Co.
22. Gavish, B. (1985). "Augmented Lagrangean Based Algorithms for Centralized Network Design." IEEE Transactions on Communications 33, 1247-1257.
23. Goemans, M.X. (1994). "The Steiner Tree Polytope and Related Polyhedra." Mathematical Programming 63(2), 157-182.
24. Goldberg, A.V. and R.E. Tarjan. (1988) "A New Approach to the Maximum Flow Problem." Journal of ACM 35, 921-940.
25. Gomory, R.E. (1963). "An Algorithm for Integer Solutions to Linear Programs," In R. Graves and P. Wolfe (eds.), Recent Advances in Mathematical Programming, New York: McGraw-Hill.
26. Guignard, M. (2004). "Lagrangean Relaxation." TOP 11(2), 151-199.
27. Held, M., P. Wolfe, and H.P. Crowder. (1974). "Validation of Subgradient Optimization." Mathematical Programming 6, 62-88.
28. Hunting, M., U. Faigle, and W. Kern. (2001). "A lagrangian Relaxation Approach to the Edge-Weighted Clique Problem." European Journal of Operational Research 131(1), 119-131.
29. Hwang, F.K. and D.S. Richards. (1992). "Steiner Tree Problems." Networks 22, 55-89.
30. CPLEX. (1999). ILOG, Inc. CPLEX Division.
31. Kruskal, J.B. (1956). "On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem." Proceedings of the American Mathematical Society 7, 48-50.
32. Letchford, A.N., G. Reinelt, and D.O. Theis. (2004). "A Faster Exact Separation Algorithm for Blossom Inequalities." Lecture Notes in Computer Science 3064.
33. Lucena, A. (1991). "Tight Bounds for the Steiner Problem in Graphs." In TIMS XXX - SOBRAPO XXIII Joint International Meeting, Rio de Janeiro.
34. Lucena, A. (1992). "Steiner Problem in Graphs: Lagrangean Relaxation and Cutting Planes." COAL Bulletin 21, 2-8.
35. Lucena, A. (1993). "Steiner Problem in Graphs: Lagrangean Relaxation and Cutting Planes." In G. Gallo and F. Malucelli (eds.), Proceedings of NETFLOW93, pp. 147-154.
36. Lucena, A. and J.E. Beasley. (1998). "A Branch and Cut Algorithm for the Steiner Problem in Graphs." Networks 31, 39-59.
37. Maculan, N. (1987). 'The Steiner Problem in Graphs." Annals of Discrete Mathematics 185-222.
38. Margot, F., A. Prodon, and T.M. Liebling. (1994). "Tree Polyhedron on 2-Tree." Mathematical Programming 63(2), 183-192.
39. Martinhon, C., A. Lucena, and N. Maculan. (2004). "Stronger k-Tree Relaxations for the Vehicle Routing Problem." European Journal of Operational Research 22, 25-45.
40. Nemhauser, G.L. and G. Sigismondi. (1992). "A Strong Cutting Plane Branch-and-Bound Algorithm for Node Packing." Journal of the Operational Research Society 43(5), 443-457.
41. Padberg, M. and G. Rinaldi. (1991). "A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems." SIAM Review 33, 60-100.
42. Palmeira, M.M., A. Lucena, and O. Porto. (1999). "A Relax and Cut Algorithm for the Quadratic Knapsack Problem." Technical report, Departamento de Administração, Universidade Federal do Rio de Janeiro.
43. Prim, R.C. (1957). "Shortest Connection Networks and Some Generalizations." Bell System Technical Journal 36(6), 1389-1401.
44. Ralphs, T.K. and M.V. Galati. (2005). "Decomposition and Dynamic Cut Generation in Integer Linear Programming." Mathematical Programming to appear.
45. Rayward-Smith, V.J. and A. Clare. (1986). "On Finding Steiner Vertices." Networks 16.
46. Ribeiro, C.C., E. Uchoa, and R.F. Werneck. (2002). "A Hybrid Grasp with Perturbations for the Steiner Problem in Graphs." INFORMS Journal on Computing 14(3), 228-246.
47. Savelsbergh, M. and A. Volgenant. (1985). "Edge Exchanges in the Degree Constrained Minimum Spanning Tree Problem." Computers and Operations Research 12(4), 341-348.
48. Takahashi, H. and A. Matsuyama. (1980). "An Approximate Solution for the Steiner Problem in Graphs." Mathematica Japonica 6, 573-577.
49. Winter, P. (1987). "Steiner problems in networks: A survey." Networks 17, 129-167.
50. Xpress-MP, release 14.05. (2004). Dash Optimization.