Facets of two Steiner arborescence polyhedra
- 1 July 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 51 (1) , 401-419
- https://doi.org/10.1007/bf01586946
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Facets of the Asymmetric Traveling Salesman PolytopeMathematics of Operations Research, 1991
- A lower bound for the steiner tree problem in directed graphsNetworks, 1990
- Integer and Combinatorial OptimizationPublished by Wiley ,1988
- Steiner problem in networks: A surveyNetworks, 1987
- The node‐weighted steiner tree problemNetworks, 1987
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967