Accelerating Benders Decomposition by Local Branching

References

• Benders J. F. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik (1962) 4(1):238–252Crossref, Google Scholar
• Birge J. R., Louveaux F. A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. (1988) 34(3):384–392Crossref, Google Scholar
• Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer, New York) Google Scholar
• Codato G., Fischetti M. Combinatorial Benders cuts for mixed-integer linear programming. Oper. Res. (2006) 54(4):756–766Link, Google Scholar
• Cordeau J.-F., Pasin F., Solomon M. M. An integrated model for logistics network design. Ann. Oper. Res. (2006) 144(1):59–82Crossref, Google Scholar
• Costa A. M. A survey on Benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. (2005) 32(6):1429–1450Crossref, Google Scholar
• Côté G., Laughton M. A. Large-scale mixed integer programming: Benders-type heuristics. Eur. J. Oper. Res. (1984) 16(3):327–333Crossref, Google Scholar
• Crainic T. G., Frangioni A., Gendron B. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. (2001) 112(1–3):73–99Crossref, Google Scholar
• Fischetti M., Lodi A. Local branching. Math. Programming (2003) 98(1-3):23–47Crossref, Google Scholar
• Geoffrion A. M. Elements of large-scale mathematical programming. Part 1: Concepts. Management Sci. (1970a) 11(11):652–675Link, Google Scholar
• Geoffrion A. M. Elements of large-scale mathematical programming. Part 2: Synthesis of algorithms and bibliography. Management Sci. (1970b) 11(11):676–691Link, Google Scholar
• Holmberg K. On the convergence of cross decomposition. Math. Programming (1990) 47(2):269–296Crossref, Google Scholar
• Holmberg K. On using approximations of the Benders master problem. Eur. J. Oper. Res. (1994) 77(1):111–125Crossref, Google Scholar
• Hooker J. N.Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction (2000) (John Wiley & Sons, New York) Crossref, Google Scholar
• Magnanti T. L., Wong R. T. Accelerating Benders decomposition algorithmic enhancement and model selection criteria. Oper. Res. (1981) 29(3):464–484Link, Google Scholar
• McDaniel D., Devine M. A modified Benders' partitioning algorithm for mixed integer programming. Management Sci. (1977) 24(3):312–319Link, Google Scholar
• Santoso T., Ahmed S., Goetschalckx M., Shapiro A. A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. (2005) 167:96–115Crossref, Google Scholar
• Van Roy T. J. Cross decomposition for mixed integer programming. Math. Programming (1983) 25(1):46–63Crossref, Google Scholar
• Van Slyke R. M., Wets R. J.-B. L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. (1969) 17(4):638–663Crossref, Google Scholar