Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
type: Item
instance of: scholarly article
title: Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
zbMATH Open document ID: 1251.90248
author: Vladimir Marianov
author: Gabriel Gutiérrez-Jarpa
author: Carlos Obreque
author: Oscar Cornejo
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6107493
zbMATH Keywords: location
zbMATH Keywords: network design
zbMATH Keywords: Lagrangean relaxation heuristics
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.cor.2011.05.015
OpenAlex ID: W2059073032
cites work: The cable trench problem: Combining the shortest path and minimum spanning tree problems
cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Solution methods for thep-median problem: An annotated bibliography
cites work: A neural model for the \(p\)-median problem
cites work: Q3147659
cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
cites work: Location-Allocation Problems
cites work: Heuristic concentration: Two stage solution construction
cites work: The \(p\)-median problem: a survey of metaheuristic approaches
cites work: A capacity scaling heuristic for the multicommodity capacitated network design problem
cites work: New formulations and solution procedures for the hop constrained network design problem.
cites work: Survivable capacitated network design problem: new formulation and Lagrangean relaxation
cites work: The complexity of the network design problem
cites work: Lagrangean relaxation. (With comments and rejoinder).
cites work: A Lagrangian heuristic for the capacitated plant location problem with single source constraints
cites work: Validation of subgradient optimization
DOI: 10.1016/J.COR.2011.05.015
description: scientific article; zbMATH DE number 6107493