Summary
This paper deals with the usage of mean value cross decomposition in a branch-and-bound method for mixed integer programming problems. Special issues discussed are heuristics for obtaining feasible integral solutions, information available to base the branching decisions and tree search strategies on and reoptimization after branching or adding valid inequalities, as well as the availability of reduced costs, to be used for variable fixation tests and branching decisions. Finally application to problems of a typical structure, facility location, is discussed, and preliminary computational results are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Aardal. Capacitated facility location: Separation algorithms and computational experience. Mathematical Programming, 81:149–175, 1998.
J. E. Beasley. Lagrangean heuristics for location problems. European Journal of Operational Research, 05:383–399, 1993.
G. W. Brown. Some notes on computation of games solutions. Technical Report RAND Report P-78, The RAND Corporation, 1949.
G. Cornuejols, M. L. Fisher, and G. L. Nemhauser. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science, 23:789–810, 1977.
D. Erlenkotter. A dual-based procedure for uncapacitated facility location. Operations Research, 26:992–1009, 1978.
A. Geoffrion and R. McBride. Lagrangean relaxation applied to capacitated facility location problems.AIIE Transactions, 10:40–47, 1978.
A. M. Geoffrion. Lagrangean relaxation for integer programming. Mathematical Programming Study, 2:82–114, 1974.
K. Holmberg. Linear mean value cross decomposition: A generalization of the Kornai-Liptak method. European Journal of Operational Research, 62:55–73, 1992.
K. Holmberg. A convergence proof for linear mean value cross decomposition. Zeitschrift für Operations Research, 39:157–186, 1994.
K. Holmberg.Efficient decomposition and linearization methods for the stochastic transportation problem. Computational Optimization and Applications, 4:293–316, 1995.
K. Holmberg. Experiments with primal-dual decomposition and subgradient methods for the uncapacitated facility location problem. Research Report LiTH-MAT-R-1995-08, Department of Mathematics, Linköping Institute of Technology, Sweden, 1995.
K. Holmberg. Mean value cross decomposition applied to integer programming problems. European Journal of Operational Research, 97:124–138, 1997.
K. Holmberg and K. Jörnsten. Solving the generalized knapsack problem with variable coefficients. Naval Research Logistics, 43:673–689, 1996.
J. Kornai and Th. Liptak. Two-level planning. Econometrica, 33:141–169, 1965.
G. Nemhauser and L. Wolsey. Integer & Combinatorial Optimization. John Wiley & Sons, 1988.
J. Robinson. An iterative method of solving a game. Annals of Mathematics, 54:296–301, 1951.
T. J. Van Roy. A cross decomposition algorithm for capacitated facility location. Operations Research, 34:145–163, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holmberg, K. (1999). Mean Value Cross Decomposition Based Branch-and-Bound for Mixed Integer Programming Problems. In: Kall, P., Lüthi, HJ. (eds) Operations Research Proceedings 1998. Operations Research Proceedings 1998, vol 1998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58409-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-58409-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65381-3
Online ISBN: 978-3-642-58409-1
eBook Packages: Springer Book Archive