Pages that link to "Item:Q1764759"

The following pages link to A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759):

Displaying 50 items.

• Decomposition based hybrid metaheuristics (Q319285) (← links)
• A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty (Q322691) (← links)
• Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles (Q322758) (← links)
• Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks (Q336554) (← links)
• Methods for removing links in a network to minimize the spread of infections (Q342308) (← links)
• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
• Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
• Tree network design avoiding congestion (Q646180) (← links)
• Generalized Benders' decomposition for topology optimization problems (Q652657) (← links)
• Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
• The generalized fixed-charge network design problem (Q856677) (← links)
• A Benders decomposition algorithm for base station planning problem in WCDMA networks (Q858274) (← links)
• A hub location problem with fully interconnected backbone and access networks (Q869014) (← links)
• The network design problem with relays (Q869627) (← links)
• Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
• Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
• An improved Benders decomposition applied to a multi-layer network design problem (Q1038109) (← links)
• A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
• Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version (Q1040964) (← links)
• From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (Q1662655) (← links)
• Decomposition techniques with mixed integer programming and heuristics for home healthcare planning (Q1699130) (← links)
• A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration (Q1711440) (← links)
• Recovery strategies from major supply disruptions in single and multiple sourcing networks (Q1713742) (← links)
• An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming (Q1713765) (← links)
• Optimal long-term distributed generation planning and reconfiguration of distribution systems: an accelerating Benders' decomposition approach (Q1730814) (← links)
• Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
• A Benders decomposition approach for solving the offshore wind farm installation planning at the North Sea (Q1751693) (← links)
• Solving minimum-cost shared arborescence problems (Q1751722) (← links)
• Combinatorial Benders cuts for assembly line balancing problems with setups (Q1751843) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints (Q1754254) (← links)
• Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem (Q1754726) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
• Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) (← links)
• Solving the optimum communication spanning tree problem (Q1991267) (← links)
• On the approximability of robust network design (Q1998836) (← links)
• Multi-warehouse package consolidation for split orders in online retailing (Q2029283) (← links)
• Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
• A Benders decomposition algorithm for the maximum availability service facility location problem (Q2108127) (← links)
• An L-shaped method with strengthened lift-and-project cuts (Q2109005) (← links)
• Meta partial Benders decomposition for the logistics service network design problem (Q2116853) (← links)
• Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure (Q2147939) (← links)
• Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach (Q2158031) (← links)
• A Benders decomposition-based approach for logistics service network design (Q2184143) (← links)
• The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms (Q2230399) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion (Q2292358) (← links)
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
• Modeling interdependencies in infrastructure systems using multi-layered network flows (Q2297565) (← links)
• Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)