A Benders decomposition algorithm for the maximum availability service facility location problem

DOI10.1016/j.cor.2022.106030OpenAlexW4297179781MaRDI QIDQ2108127

Ali Muffak, Okan Arslan

Publication date: 19 December 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.106030

zbMATH Keywords

Benders decompositionservice facilityPareto-optimal cutlocation optimizationmaximum availability

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Algorithms for a risk-averse Stackelberg game with multiple adversaries

Uses Software

• LEMON
• NETGEN

Cites Work

• A branch and price approach for routing and refueling station location model
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• Practical enhancements to the Magnanti-Wong method
• Partitioning procedures for solving mixed-variables programming problems
• Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
• Benders decomposition for very large scale partial set covering and maximal covering location problems
• The Benders decomposition algorithm: a literature review
• A survey on Benders decomposition applied to fixed-charge network design problems
• A maximal covering location model in the presence of partial coverage
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
• Multicut Benders decomposition algorithm for process supply chain planning under uncertainty
• Modeling health care facility location for moving population groups
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Ambulance location for maximum survival
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Optimal Location of Discretionary Service Facilities
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Evasive flow capture: Optimal location of weigh‐in‐motion systems, tollbooths, and security checkpoints
• Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
• Exact Solution of the Evasive Flow Capturing Problem
• Covering Problems