Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
From MaRDI portal
Publication:1762012
DOI10.1016/J.COR.2011.05.015zbMath1251.90248OpenAlexW2059073032MaRDI QIDQ1762012
Carlos Obreque, Oscar Cornejo, Gabriel Gutiérrez-Jarpa, Vladimir Marianov
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.05.015
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (5)
The \(p\)-arborescence star problem: formulations and exact solution approaches ⋮ A Benders decomposition based framework for solving cable trench problems ⋮ Branch‐and‐cut algorithms for the ‐arborescence star problem ⋮ Perspectives on modeling hub location problems ⋮ Modeling the capacitated \(p\)-cable trench problem with facility costs
Uses Software
Cites Work
- Unnamed Item
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- Heuristic concentration: Two stage solution construction
- New formulations and solution procedures for the hop constrained network design problem.
- Lagrangean relaxation. (With comments and rejoinder).
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- A neural model for the \(p\)-median problem
- Survivable capacitated network design problem: new formulation and Lagrangean relaxation
- Solution methods for thep-median problem: An annotated bibliography
- Location-Allocation Problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- The complexity of the network design problem
- Validation of subgradient optimization
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- The cable trench problem: Combining the shortest path and minimum spanning tree problems
This page was built for publication: Lagrangean relaxation heuristics for the \(p\)-cable-trench problem