Efficient cuts in Lagrangean 'relax-and -cut' schemes

European Journal of Operational Research

Volumn 105, Issue 1, 1998, Pages 216-223

  Guignard, Monique ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Cuts; Cutting planes; Duality gaps; Facets; Integer programming; Lagrangean relaxation; Valid inequalities

Indexed keywords

INTEGER PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES;

CUTS; DUALITY GAPS; FACETS; LAGRANGEAN RELAXATION;

OPERATIONS RESEARCH;

EID: 0032002578     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00034-9     Document Type: Article

References (15)

1. Aboudi, R., Hallefjord, A., Jornsten, K., 1991. A facet generation and relaxation technique applied to an assignment problem with side constraints. European Journal of Operational Research 50, 335-344.
2. Brooke, A., Kendrick, D., Meeraus, A., 1992. GAMS Release 2.25: A user's guide. Scientific Press.
3. Escudero, L.F., Guignard, M., Malik, K., 1994. A Lagrangean relax-and-cut approach for the sequential ordering problem with precedence relationships. In: Ribeiro, C.C. (Ed.), Annals of Operations Research 50, Applications of Combinatorial Optimization, pp. 219-237.
4. Fischetti, M., 1991. Facets of the asymmetric traveling salesman problem. Mathematics of Operations Research 16 (1), 42-56.
5. Fisher, M.L., Jaikumar, R., Van Wassenhove, L., 1986. A multiplier adjustment method for the generalized assignment problem. Management Science 32, 1095-1103.
6. Geoffrion, A.M., 1974. Lagrangean relaxation and its uses in integer programming. Mathematical Programming Study 2, 82-114.
7. Guignard, M., Kim, S., Wang, X., 1997. On the use of Lagrangean relaxation and penalties within branch-and-bound. Presentation at INFORMS Meeting, San Diego.
8. Guignard, M., Rosenwein, M.B., 1990. An improved dual-based algorithm for the generalized assignment problem. Operations Research 37 (4), 658-663.
9. Guignard, M., Zhu, S., 1994a. A 2-phase dual method for solving Lagrangean duals. Department of OPIM Report 94-10-03.
10. Guignard, M., Zhu, S., 1994b. A hybrid algorithm for solving Lagrangean duals in mixed integer programming. In: Bosch, M., Ortiz, C. (Eds.), Proceedings of the VII CLAIO. Santiago, Chile, pp. 399-410.
11. Hong, S., 1976. The asymmetric traveling salesman problem and spanning arborescences of directed graphs. Methods of Operations Research 25, 192-204.
12. Malik, K., Guignard, M., 1992. A strengthened Lagrangean approach to the traveling salesman problem. Department of Decision Sc. Report 92-01-11.
13. Martello, S., Toth, P., 1981. An algorithm for the generalized assignment problem. In: Proceedings of the 9th IFORS Conference. Hamburg, Germany, pp. 589-603.
14. Nauss, R.M., 1974. Parametric Integer Programming. Ph.D. Dissertation. U.C.L.A., 1974.
15. Ross, G.T., Soland, R.M., 1975. A branch-and-bound algorithm for the generalized assignment problem. Mathematical Programming 8 (1), 91-103.