A Benders decomposition algorithm for the maximum availability service facility location problem
From MaRDI portal
Publication:2108127
Recommendations
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- Multicommodity flows and Benders decomposition for restricted continuous location problems
- Capacitated multi-period maximal covering location problem with server uncertainty
Cites work
- A branch and price approach for routing and refueling station location model
- A maximal covering location model in the presence of partial coverage
- A survey on Benders decomposition applied to fixed-charge network design problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Ambulance location for maximum survival
- Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Covering Problems
- Evasive flow capture: optimal location of weigh-in-motion systems, tollbooths, and security checkpoints
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Exact solution of the evasive flow capturing problem
- Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
- Modeling health care facility location for moving population groups
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Optimal Location of Discretionary Service Facilities
- Partitioning procedures for solving mixed-variables programming problems
- Practical enhancements to the Magnanti-Wong method
- The Benders decomposition algorithm: a literature review
Cited in
(13)- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Multicommodity flows and Benders decomposition for restricted continuous location problems
- Capacitated multi-period maximal covering location problem with server uncertainty
- An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- Solving a bicriteria problem of optimal service centers location
- Algorithms for a risk-averse Stackelberg game with multiple adversaries
- Demand allocation policies for the charging station location and sizing problem
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- Modelling a capacitated location problem for designing multimodal vaccine distribution network using a novel health emergency susceptibility index
- Benders decomposition for the large-scale probabilistic set covering problem
- Optimizing service networks to support freight rail decarbonization: flow selection, facility location, and energy sourcing
- Mathematical modelling and an effective algorithm for unidirectional loop layout problem with fixed loading and unloading points
This page was built for publication: A Benders decomposition algorithm for the maximum availability service facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108127)
