A hop constrained min-sum arborescence with outage costs

DOI10.1016/j.cor.2005.10.009zbMath1141.90490OpenAlexW2096032033MaRDI QIDQ875410

Rakesh Kawatra

Publication date: 13 April 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.10.009

zbMATH Keywords

heuristicsinteger programmingtelecommunications

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks ⋮ Minimax regret spanning arborescences under uncertain costs ⋮ Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks

Cites Work

• Unnamed Item
• A Lagrangean approach to the degree-constrained minimum spanning tree problem
• Multicommodity flow models for spanning trees with hop constraints
• Topological design of a centralized communication network with unreliable links and node outage costs
• A multiperiod degree constrained minimal spanning tree problem
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• Validation of subgradient optimization
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem

This page was built for publication: A hop constrained min-sum arborescence with outage costs