Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
暂无分享,去创建一个
[1] Alysson M. Costa. A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..
[2] A. M. Geoffrion,et al. Multicommodity Distribution System Design by Benders Decomposition , 1974 .
[3] Matteo Fischetti,et al. Benders decomposition without separability: A computational study for capacitated facility location problems , 2016, Eur. J. Oper. Res..
[4] A. M. Geoffrion. Generalized Benders decomposition , 1972 .
[5] Matteo Fischetti,et al. Redesigning Benders Decomposition for Large-Scale Facility Location , 2017, Manag. Sci..
[6] Matteo Fischetti,et al. A note on the selection of Benders’ cuts , 2010, Math. Program..
[7] Iván A. Contreras,et al. Hub Location as the Minimization of a Supermodular Set Function , 2014, Oper. Res..
[8] Thomas L. Magnanti,et al. Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..
[9] Francisco Saldanha-da-Gama,et al. A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method , 2017, Math. Program..
[10] Ricardo Saraiva de Camargo,et al. An improved Benders decomposition algorithm for the tree of hubs location problem , 2013, Eur. J. Oper. Res..
[11] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[12] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .
[13] Natashia Boland,et al. Scheduling arc maintenance jobs in a network to maximize total flow over time , 2014, Discret. Appl. Math..
[14] Martin W. P. Savelsbergh,et al. Lifted Cover Inequalities for 0-1 Integer Programs: Complexity , 1999, INFORMS J. Comput..
[15] Mohamad Saeed Jabalameli,et al. Modeling the budget-constrained dynamic uncapacitated facility location-network design problem and solving it via two efficient heuristics: A case study of health care , 2013, Math. Comput. Model..
[16] Matteo Fischetti,et al. Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..
[17] Ricardo Saraiva de Camargo,et al. Benders decomposition for the uncapacitated multiple allocation hub location problem , 2008, Comput. Oper. Res..
[18] M. D. Devine,et al. A Modified Benders' Partitioning Algorithm for Mixed Integer Programming , 1977 .
[19] Peter Elias,et al. A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.
[20] John E. Mitchell,et al. Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem , 2012, Eur. J. Oper. Res..
[21] Jean-François Cordeau,et al. Benders Decomposition for Production Routing Under Demand Uncertainty , 2012, Oper. Res..
[22] Wei Jiang,et al. An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions , 2013, Ann. Oper. Res..
[23] Thomas L. Magnanti,et al. Tailoring Benders decomposition for uncapacitated network design , 1986 .
[24] Iván A. Contreras,et al. The Hub Line Location Problem , 2015, Transp. Sci..
[25] Jean-François Cordeau,et al. Solving a dynamic facility location problem with partial closing and reopening , 2016, Comput. Oper. Res..