Benders decomposition for network design covering problems

DOI10.1016/j.cor.2021.105417OpenAlexW3168487990MaRDI QIDQ2669611

Natividad González-Blanco, Víctor Bucarey, Juan A. Mesa, Martine Labbé, Bernard Fortz

Publication date: 9 March 2022

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

Full work available at URL: https://arxiv.org/abs/2007.06647

zbMATH Keywords

network designBenders decompositionrapid transit networkfacility planning and design

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm

Uses Software

• stprbh

Cites Work

• Benders, metric and cutset inequalities for multicommodity capacitated network design
• Lift-and-project for mixed 0-1 programming: recent progress
• Transportation systems analysis. Models and applications.
• Urban rapid transit network design: accelerated Benders decomposition
• An improved Benders decomposition applied to a multi-layer network design problem
• Partitioning procedures for solving mixed-variables programming problems
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
• Benders decomposition for very large scale partial set covering and maximal covering location problems
• The Benders decomposition algorithm: a literature review
• Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm
• Location of speed-up subnetworks
• ``Facet separation with one linear program
• GRASP algorithms for the robust railway network design problem
• A note on the selection of Benders' cuts
• Exact approaches to the single-source network loading problem
• TWO THEOREMS IN GRAPH THEORY
• An Algorithm for a Minimum Cover of a Graph
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• Tailoring Benders decomposition for uncapacitated network design
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• Network Design Using Cut Inequalities
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• The Location of Emergency Service Facilities