Lagrangean relaxation heuristics for the p-cable-trench problem
DOI10.1016/J.COR.2011.05.015zbMATH Open1251.90248OpenAlexW2059073032MaRDI QIDQ1762012FDOQ1762012
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
Recommendations
- A Benders decomposition based framework for solving cable trench problems
- A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks
- Lagrangean heuristics for location problems
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- Applying Lagrangian relaxation to the resolution of two-stage location problems
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Location-Allocation Problems
- Validation of subgradient optimization
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- The \(p\)-median problem: a survey of metaheuristic approaches
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Solution methods for thep-median problem: An annotated bibliography
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Lagrangean relaxation. (With comments and rejoinder).
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- The complexity of the network design problem
- Title not available (Why is that?)
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- A neural model for the \(p\)-median problem
- New formulations and solution procedures for the hop constrained network design problem.
- Survivable capacitated network design problem: new formulation and Lagrangean relaxation
- Heuristic concentration: Two stage solution construction
- The cable trench problem: Combining the shortest path and minimum spanning tree problems
Cited In (7)
- Branch‐and‐cut algorithms for the ‐arborescence star problem
- A Benders decomposition based framework for solving cable trench problems
- Modeling the capacitated \(p\)-cable trench problem with facility costs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The \(p\)-arborescence star problem: formulations and exact solution approaches
- Perspectives on modeling hub location problems
Uses Software
This page was built for publication: Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762012)
