A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- 1 August 2001
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 132 (3) , 539-552
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network designDiscrete Applied Mathematics, 2001
- Packet Routing in Telecommunication Networks with Path and Flow RestrictionsINFORMS Journal on Computing, 1999
- The 2-hop spanning tree problemOperations Research Letters, 1998
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop ConstraintsINFORMS Journal on Computing, 1998
- A Lagrangean Heuristic Based Branch-and-Bound Method for the Capacitated Network Design Problem1997
- Multicommodity flow models for spanning trees with hop constraintsEuropean Journal of Operational Research, 1996
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraintsComputers & Operations Research, 1995
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete DigraphsINFORMS Journal on Computing, 1993
- An algorithm for the steiner problem in graphsNetworks, 1984
- Validation of subgradient optimizationMathematical Programming, 1974