Packing Steiner trees: a cutting plane algorithm and computational results
Authors:
- 1 February 1996
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 72 (2) , 125-145
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Packing Steiner Trees: Separation AlgorithmsSIAM Journal on Discrete Mathematics, 1996
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Review, 1991
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity ConstraintsSIAM Journal on Discrete Mathematics, 1990
- BEAVER: a computational-geometry-based tool for switchbox routingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Channel-Routing Problem in the Knock-Knee Mode Is NP-CompleteIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- A greedy switch-box routerIntegration, 1985
- Hierarchical Wire RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- The steiner problem in graphsNetworks, 1971
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962