Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
From MaRDI portal
Publication:1754726
DOI10.1016/j.ejor.2018.03.021zbMath1403.90485arXiv1703.06581OpenAlexW2616657755WikidataQ130116018 ScholiaQ130116018MaRDI QIDQ1754726
Publication date: 31 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.06581
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (5)
Benders decomposition for a period-aggregated resource leveling problem with variable job duration ⋮ Combining optimisation and simulation using logic-based Benders decomposition ⋮ Fix-and-optimize approach for a healthcare facility location/network design problem considering equity and accessibility: a case study ⋮ Design of survivable wireless backhaul networks with reliability considerations ⋮ Heuristics for the dynamic facility location problem with modular capacities
Uses Software
Cites Work
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Solving a dynamic facility location problem with partial closing and reopening
- Scheduling arc maintenance jobs in a network to maximize total flow over time
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Partitioning procedures for solving mixed-variables programming problems
- A survey on Benders decomposition applied to fixed-charge network design problems
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Modeling the budget-constrained dynamic uncapacitated facility location-network design problem and solving it via two efficient heuristics: a case study of health care
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- Generalized Benders decomposition
- A note on the selection of Benders' cuts
- Hub Location as the Minimization of a Supermodular Set Function
- Maximal Flow Through a Network
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Benders Decomposition for Production Routing Under Demand Uncertainty
- Tailoring Benders decomposition for uncapacitated network design
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Location Science
This page was built for publication: Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
