Designing a minimal spanning tree network subject to a budget constraint

DOI10.1080/02331938808843366zbMath0653.90085OpenAlexW2163367282MaRDI QIDQ3799839

S. Migdalas, Kurt O. Jørnsten

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938808843366

zbMATH Keywords

Lagrangean relaxationknapsack problemsubgradient optimizationside constraintsminimal spanning treedesign of computer communication networksdublication of variables

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items (1)

A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A heuristic approach to hard constrained shortest path problems
• A new Lagrangian relaxation approach to the generalized assignment problem
• On the choice of step size in subgradient optimization
• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• Methods of descent for nondifferentiable optimization
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• An Algorithm for Large Zero-One Knapsack Problems
• Two Algorithms for Generating Weighted Spanning Trees in Order

This page was built for publication: Designing a minimal spanning tree network subject to a budget constraint