A branch and cut algorithm for a Steiner tree-star problem

INFORMS Journal on Computing

Volumn 8, Issue 3, 1996, Pages 194-201

  Lee, Youngho ^a   Chiu, Steve Y ^a   Ryan, Jennifer ^a  

^a US West Advanced Technologies   (United States)

Author keywords

Branch and cut; Digital data networks; Node weighted Steiner tree; Polyhedral structure; Telecommunications networks

Indexed keywords

EID: 0002955266     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.8.3.194     Document Type: Article

References (10)

1. J. CHERIYAN and T. HAGERUP, 1989. A Randomized Maximum-Flow Algorithm, in Proceedings of 30th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press.
2. S. CHOPRA and E. GORRES, 1990. On the Node Weighted Steiner Tree Problem, Working paper, Northwestern University.
3. S. CHOPRA and M.R. RAO, 1989. On the Steiner Tree Problem I & II, Working paper. New York University.
4. S. CHOPRA, E. GORRES, and M.R. RAO, 1992. Solving the Steiner Tree Problem on a Graph Using Branch and Cut, ORSA Journal on Computing 4:3, 320-336.
5. V. CHVÁTAL, 1983. Linear Programming, Freeman & Co.
6. H. CROWDER, E.L. JOHNSON, and M.W. PADBERG, 1983. Solving Large-Scale Zero-One Linear Programming Problems, Operations Research 31, 803-834.
7. J. EDMONDS, 1970. Submodular Functions, Matroids and Certain Polyhedra, in Combinatorial structures and their applications, R. Guy et al. (eds.), Gordon and Breach.
8. M. FISCHETTI, 1989. Facets of two Steiner Arborescence Polyhedra, Technical Report OR-89-4, University of Bologna.
9. M.R. GAREY and D.S. JOHNSON, 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman & Co.
10. M.X. GOEMANS, 1992. The Steiner Tree Polytope and Related Polyhedra, Working paper, Department of Mathematics, MIT.