Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes

European Journal of Operational Research

Volumn 121, Issue 3, 2000, Pages 609-626

  Sáez, Jesús ^a  

^a UNIVERSITY OF VALLADOLID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; CONSTRAINT THEORY; GRAPH THEORY; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; SET THEORY;

CUTTING PLANES; LAGRANGEAN RELAXATION; LINEAR PROGRAMMING RELAXATION;

LINEAR PROGRAMMING;

EID: 0342298588     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00056-9     Document Type: Article

References (36)

1. K. Aardal, S. Van Hoesel, Polyhedral techniques in combinatorial optimization, Report UU-CS-1997, Department of Computer Science, Utrecht University, 1997.
2. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Networks Flows, Prentice-Hall, Englewood Cliffs, NJ, 1996.
3. Ali A.I., Shmerling S. Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxations methodologies. Operations Research Letters. 18:1996;177-184.
4. Balas E., Ceria S., Cornuéjols G. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Science. 42:1996;1229-1246.
5. J.E. Beasley, Lagrangean Relaxation, in: C.R. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1993, pp. 243-298.
6. Bixby R.E., Boyd E.A., Indovina R. MIPLIB: A test set of mixed integer programming problems. SIAM News. 25:1992;16.
7. R.E. Bixby, S. Ceria, C.M. McZeal, M.W.P. Savelsbergh, An updated mixed integer programming library: MIPLIB 3.0, Submitted to SIAM News, 1996.
8. Boyd E.A. Generating fenchel cutting planes for knapsack polyhedra. SIAM Journal of Optimization. 3:1993;734-750.
9. E.A. Boyd, Solving 0/1 integer programs with Fenchel cutting planes and preprocessing, Report INEN/OR/WP/3/3-93.
10. Boyd E.A. Fenchel cutting planes for integer programming. Operations Research. 42:1994;53-64.
11. Boyd E.A. On the convergence of Fenchel cutting planes in mixed-integer programming. SIAM Journal of Optimization. 5:1995;421-435.
12. CPLEX Optimization Inc., Using the CPLEX Callable Library and CPLEX Mixed Integer Library, Version 4.0, 1996.
13. Crowder H., Johnson E.L., Padberg M.W. Solving large-scale zero-one linear programming problems. Operations Research. 31:1983;803-834.
14. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science. 27:1981;1-18.
15. Fisher M.L. An application oriented guide to Lagrangian relaxation. Interfaces. 12:1985;10-21.
16. Geoffrion A.M. Lagrangian relaxation and its uses in integer programming. Mathematical Programming Study. 2:1974;82-114.
17. F. Glover, Effective surrogate constraint relaxations for integer programming, 1996.
18. Glover F., Sherali H.D., Lee Y. Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming. Computational Optimization and Applications. 8:1997;151-172.
19. Guignard M. Efficient cuts in Lagrangean relax-and-cut schemes. European Journal of Operational Research. 105:1998;216-223.
20. Guignard M., Kim S. Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Mathematical Programming. 39:1987;215-228.
21. M. Grötschel, M.W. Padberg, Polyhedral theory, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, Wiley, New York, 1985.
22. Held H.M., Wolfe P., Crowder H.D. Validation of subgradient optimization. Mathematical Programming. 6:1974;62-88.
23. Hoffman K., Padberg M. LP-based combinatorial problem solving. Annals of Operations Research. 4:1985;145-194.
24. John C.G., Kochenberger G.A. Using surrogate constraints in a Lagrangian relaxation approach to set-covering problems. Journal of the Operational Research Society. 39:1988;681-685.
25. E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, Progress in integer programming: An exposition, INFORMS Journal on Computing, submitted.
26. T.M. Magee, F. Glover, Integer Programming, in: M. Avriel, B. Golany (Eds.), Mathematical Programming for Industrial Engineers, cap. 3, Marcel Dekker, New York, 1996, pp. 123-269.
27. S. Martello, P. Toth, Knapsack problems: Algorithms and computer implementations, Wiley, New York, 1990.
28. Nemhauser G.L., Savelsbergh M.W.P., Sigismondi G.C. MINTO, a mixed integer optimizer. Operations Research Letters. 15:1994;47-58.
29. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
30. G. Parker, R. Rardin, Discrete optimization, Academic Press, New York, 1988.
31. L. Schrage, User's Manual for Linear, Integer and Quadratic Programming with LINDO, Release 5.3, The Scientific Press, 1991.
32. Shapiro J.F. Generalized Lagrange multipliers in integer programming. Operations Research. 19:1971;68-76.
33. Shapiro J.F. A survey of Lagrangean techniques for discrete optimization. Annals of Discrete Mathematics. 5:1979;113-138.
34. J.F. Shapiro, Mathematical Programming: Structures and Algorithms, Wiley, New York, 1979.
35. J.F. Shapiro, Mathematical programming models for production planning and scheduling, in: S.C. Graves, A.H. Rinnooy Kan, P.H. Zipkin (Eds.), Handbooks in Operations Research and Management Science, vol. 4, Logistics of Production and Inventory, North-Holland, 1993, pp. 371-443.
36. H.P. Williams, Model Building in Mathematical Programming, 3rd ed., Wiley, New York, 1993.