Lagrangean relaxation heuristics for the p-cable-trench problem

DOI10.1016/J.COR.2011.05.015MaRDI QIDQ1762012zbMATH OpenOpenAlexFDO

Authors Vladimir Marianov, Gabriel Gutiérrez-Jarpa, Carlos Obreque, Oscar Cornejo

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

zbMATH Keywords

locationnetwork designLagrangean relaxation heuristics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

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

Cites work

• scientific article; zbMATH DE number 1803757 (Why is no real title available?)
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints
• A capacity scaling heuristic for the multicommodity capacitated network design problem
• A neural model for the p-median problem
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Heuristic concentration: Two stage solution construction
• Lagrangean relaxation. (With comments and rejoinder).
• Location-Allocation Problems
• New formulations and solution procedures for the hop constrained network design problem.
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Solution methods for thep-median problem: An annotated bibliography
• Survivable capacitated network design problem: new formulation and Lagrangean relaxation
• The \(p\)-median problem: a survey of metaheuristic approaches
• The cable trench problem: Combining the shortest path and minimum spanning tree problems
• The complexity of the network design problem
• Validation of subgradient optimization

Cited in

(9)

• Branch‐and‐cut algorithms for the ‐arborescence star problem
• A multi-objective perspective on the cable-trench problem
• A Benders decomposition based framework for solving cable trench problems
• Geometric probability models to analyze strategies for finding a buried cable
• Modeling the capacitated \(p\)-cable trench problem with facility costs
• scientific article; zbMATH DE number 6318187 (Why is no real title available?)
• scientific article; zbMATH DE number 1786144 (Why is no real title available?)
• The p-arborescence star problem: formulations and exact solution approaches
• Perspectives on modeling hub location problems

Describes a project that uses

Uses Software

• OR-Library

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)