Generalized network design problems
- 1 July 2003
- journal article
- review article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 148 (1), 1-13
- https://doi.org/10.1016/s0377-2217(02)00404-6
Abstract
No abstract availableThis publication has 34 references indexed in Scilit:
- A comparative analysis of several formulations for the generalized minimum spanning tree problemNetworks, 2001
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree ProblemJournal of Algorithms, 2000
- The partial constraint satisfaction problem: Facets and lifting theoremsOperations Research Letters, 1998
- An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphsInformation Sciences, 1997
- Some Applications of the Generalized Travelling Salesman ProblemJournal of the Operational Research Society, 1996
- The shortest path with at most / nodes in each of the series/parallel clustersNetworks, 1995
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner TreesJournal of Algorithms, 1995
- Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problemInformation Sciences, 1993
- Some generalizations of the steiner problem in graphsNetworks, 1987
- The node‐weighted steiner tree problemNetworks, 1987