Lagrangian relaxation for integer programming

50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art

Volumn , Issue , 2010, Pages 243-281

  Geoffrion, Arthur M ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84885825951     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-68279-0_9     Document Type: Chapter

References (38)

1. E. Balas, An additive algorithm for solving linear programs with zero-one variables, Operations Research 13 (1965) 517-546.
2. R. Brooks and A.M. Geoffrion, Finding Everett's Lagrange multipliers by linear programming, Operations Research 14 (1966) 1149-1153.
3. A.M. Geoffrion, Integer programming by implicit enumeration and Balas' method, Review of the Society for Industrial and Applied Mathematics 9 (1967) 178-190.
4. A.M. Geoffrion, An improved implicit enumeration approach for integer programming, Operations Research 17 (1969) 437-454.
5. A.M. Geoffrion, Elements of large-scale mathematical programming, Management Science 16 (1970) 652-691.
6. A.M. Geoffrion, Duality in nonlinear programming, SIAM Review 13 (1971) 1-37.
7. A.M. Geoffrion and G.W. Graves, Multicommodity distribution system design by Benders decomposition, Management Science 20 (1974) 822-844.
8. A.M. Geoffrion, Lagrangean relaxation for integer programming, Mathematical Programming Study 2 (1974) 82-114.
9. R.D. Armstrong and P. Sinha, "Improved penalty calculations for a mixed integer branch-and-bound algorithm,", Mathematical Programming 6 (1974) 212-223.
10. R. Brooks and A. Geoffrion, "Finding Everett's Lagrange multipliers by linear programming,", Operations Research 14 (1966) 1149-1153.
11. Dakin, R.J., "A tree search algorithm for mixed integer programming problems,", Computer Journal, 8 (1965) 250-255.
12. N.J. Driebeek, "An algorithm for the solution of mixed integer programming problems,", Management Science 12 (1966) 576-587.
13. Everett, H.M., "Generalized Lagrange multiplier method for solving problems of optimum allocation of resources,", Operations Research 11 (1966) 399-417.
14. M.L. Fisher, "Optimal solution of scheduling problems using Lagrange multipliers: Part I,", Operations Research 21 (1973) 1114-1127.
15. M.L. Fisher, "A dual algorithm for the one-machine scheduling problem,", Graduate School of Business Rept., University of Chicago, Chicago, 111. (1974).
16. M.L. Fisher, W.D. Northup and J.F. Shapiro, "Using duality to solve discrete optimization problems: Theory and computational experience,", Working Paper OR 030-74, Operations Research Center, M.I.T. (1974).
17. M.L. Fisher and L. Schrage, "Using Lagrange multipliers to schedule elective hospital admissions,", Working Paper, University of Chicago, Chicago, 111. (1972).
18. M.L. Fisher and J.F. Shapiro, "Constructive duality in integer programming,", SIAM Journal on Applied Mathematics, to appear.
19. J.J.H. Forrest, J.P.H. Hirst and J.A. Tomlin, "Practical solution of large mixed integer programming problems with UMPIRE,", Management Science 20 (1974) 733-773.
20. A.M. Geoffrion, "An improved implicit enumeration approach for integer programming,", Operations Research 17 (1969) 437-454.
21. A.M. Geoffrion, "Duality in nonlinear programming,", SIAM Review 13 (1971) 1-37.
22. A.M. Geoffrion and R.E. Marsten, "Integer programming algorithms: A framework and state-of-the-art survey,", Management Science 18 (1972) 465-491.
23. A.M. Geoffrion and R.D. McBride, "The capacitated facility location problem with additional constraints,", paper presented to the Joint National Meeting of AIIE, ORSA, and TIMS, Atlantic City, November 8-10, 1972.
24. F. Glover, "A multiphase-dual algorithm for the zero-one integer programming problem,", Operations Research 13 (1965) 879-919.
25. F. Glover, "Surrogate constraints,", Operations Research 16 (1968) 741-749.
26. H.J. Greenberg and T.C. Robbins, "Finding Everett's Lagrange multipliers by Generalized Linear Programming, Parts I, II, and III,", Tech. Rept. CP-70008, Computer Science/Operations Research Center, Southern Methodist University, Dallas, Tex. revised (June 1972).
27. W.C. Healy, Jr., "Multiple choice programming,", Operations Research 12 (1964) 122-138.
28. M. Held and R.M. Karp, "The traveling salesman problem and minimum spanning trees,", Operations Research 18 (1970) 1138-1162.
29. M. Held and R.M. Karp, "The traveling salesman problem and minimum spanning trees: Part II,", Mathematical Programming 1 (1971) 6-25.
30. M. Held, P. Wolfe and H.P. Crowder, "Validation of subgradient optimization,", Mathematical Sciences Department, IBM Watson Research Center, Yorktown Heights, N.Y. (August 1973).
31. W.W. Hogan, R.E. Marsten and J.W. Blankenship, "The BOXSTEP method for large scale optimization,", Working Paper 660-73, Sloan School of Management, M.I.T. (December 1973).
32. R.E. Marsten, private communication (August 22, 1973).
33. G.L. Nemhauser and Z. Ullman, "A note on the generalized Lagrange multiplier solution to an integer programming problem,", Operations Research 16 (1968) 450-452.
34. G.T. Ross and R.M. Soland, "A branch and bound algorithm for the generalized assignment problem,", Mathematical Programming, to appear.
35. J.F. Shapiro, "Generalized Lagrange multipliers in integer programming,", Operations Research 19 (1971) 68-76.
36. J.A. Tomlin, "An improved branch and bound method for integer programming,", Operations Research 19 (1971) 1070-1075.
37. J.A. Tomlin, "Branch and bound methods for integer and non-convex programming,", in: J. Abadie, ed., Integer and nonlinear programming (North-Holland, Amsterdam, 1970).
38. A.F. Veinott and G.B. Dantzig, "Integral extreme points,", SIAM Review 10 (1968) 371-372.