A hop constrained min-sum arborescence with outage costs
type: Item
instance of: scholarly article
title: A hop constrained min-sum arborescence with outage costs
zbMATH Open document ID: 1141.90490
author: Rakesh Kawatra
published in: Computers \& Operations Research
publication date: 2007-04-13T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5142326
zbMATH Keywords: telecommunications
zbMATH Keywords: integer programming
zbMATH Keywords: heuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2005.10.009
OpenAlex ID: W2096032033
cites work: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
cites work: Multicommodity flow models for spanning trees with hop constraints
cites work: Topological design of a centralized communication network with unreliable links and node outage costs
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: A multiperiod degree constrained minimal spanning tree problem
cites work: A Lagrangean approach to the degree-constrained minimum spanning tree problem
cites work: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
cites work: Validation of subgradient optimization
cites work: Q4350039
DOI: 10.1016/J.COR.2005.10.009
description: scientific article; zbMATH DE number 5142326