User menu

Cross Decomposition for Mixed Integer Programming

Bibliographic reference Vanroy, TJ.. Cross Decomposition for Mixed Integer Programming. In: Mathematical Programming, Vol. 25, no. 1, p. 46-63 (1983)
Permanent URL
  1. E. Balas and C. Bergthaller, “Benders method revisited”, Management Sciences Report 401, Carnegie-Mellon University (Pittsburgh, PA, 1977).
  2. J.F. Benders, “Partitioning for solving mixed variables programming problems’,Numerische Mathematik 4 (1962), 238–252.
  3. G.B. Dantzig and P. Wolfe, “Decomposition principle for linear programs”,Operations Research 8 (1960) 101–111.
  4. Fisher M. L., Northup W. D., Shapiro J. F., Using duality to solve discrete optimization problems: Theory and computational experience, Nondifferentiable Optimization (1975) ISBN:9783642007637 p.56-94, 10.1007/bfb0120699
  5. M.L. Fisher, “The Lagrangean relaxation method for solving integer programming problems”,Management Science 27 (1981) 1–18.
  6. Geoffrion A. M., Lagrangean relaxation for integer programming, Approaches to Integer Programming (1974) ISBN:9783642007392 p.82-114, 10.1007/bfb0120690
  7. G.W. Graves and T.J. Van Roy, “Decomposition for large scale linear and mixed integer linear programming”, Working Paper, Graduate School of Management. UCLA (Los Angeles, November 1979).
  8. L.S. Lasdon,Optimization theory for large systems (MacMillan, New York, 1970).
  9. D. McDaniel and M. Devine, “A modified Benders' partitioning algorithm for mixed integer programming”,Management Science (1977) 312–379.
  10. D.J. Sweeney and R.A. Murphy, “A method of decomposition for integer programs”,Operations Research 27 (1979) 1128–1141.
  11. T.J. Van Roy, “A cross decomposition algorithm for capacitated facility location”, to appear inOperations Research.
  12. T.J. Van Roy, “Cross decomposition for large-scale mixed integer linear programming with applications to facility location on distribution networks”, doctoral dissertation, Applied Sciences, Katholieke Universiteit Leuven (1980).
  13. Wolsey Laurence A., A resource decomposition algorithm for general mathematical programs, Mathematical Programming Studies (1981) ISBN:9783642008054 p.244-257, 10.1007/bfb0120932