On the generalized minimum spanning tree problem
- 1 December 1995
- Vol. 26 (4), 231-241
- https://doi.org/10.1002/net.3230260407
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A Dual-Based Algorithm for Multi-Level Network DesignManagement Science, 1994
- A catalog of steiner tree formulationsNetworks, 1993
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman ProblemOperations Research, 1991
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network DesignOperations Research, 1989
- The prize collecting traveling salesman problemNetworks, 1989
- Tree structured fiber optics MANsIEEE Journal on Selected Areas in Communications, 1988
- Generalized travelling salesman problem through n sets of nodes: the asymmetrical caseDiscrete Applied Mathematics, 1987
- Fiber Optic Regional Area Networks in New York and DallasIEEE Journal on Selected Areas in Communications, 1986
- A dual ascent approach for steiner tree problems on a directed graphMathematical Programming, 1984
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978