A Benders decomposition based framework for solving cable trench problems
DOI10.1016/j.cor.2016.12.015zbMath1391.90505OpenAlexW2567364810WikidataQ56524095 ScholiaQ56524095MaRDI QIDQ1652230
Martin Luipersbeck, Hatice Calik, Markus Leitner
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01669247/file/paper.pdf
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (7)
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- Partitioning procedures for solving mixed-variables programming problems
- A column generation approach to capacitated \(p\)-median problems
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- On implementing push-relabel method for the maximum flow problem
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- The m-Center Problem
- The cable trench problem: Combining the shortest path and minimum spanning tree problems
This page was built for publication: A Benders decomposition based framework for solving cable trench problems