Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints

INFORMS Journal on Computing

Volumn 10, Issue 2, 1998, Pages 180-188

  Gouveia, Luis ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Integer programming; Tree algorithms; Variable redefinition

Indexed keywords

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

References (28)

1. A. BALAKRISHNAN and K. ALTINKEMER, 1992. Using a Hop-Constrained Model to Generate Alternative Communication Network Design, ORSA Journal on Computing 4, 192-205.
2. J. BEASLEY and N. CHRISTOFIDES, 1989. An Algorithm for the Resource Constrained Shortest Path Problem, Networks 19, 379-394.
3. C. COULLARD, B. GAMBLE, and J. LIU, 1994. The K-Walk Polyhedron, in Advances in Optimization and Approximation, Ding-Zhu Du and Jie Sen (eds.), Kluwer Academic Publishers, Dordrecht, The Netherlands, 9-29.
4. S. CHOPRA, E. GORRES, and M. RAO, 1992. Solving the Steiner Tree Problem on a Graph Using Branch and Cut, ORSA Journal on Computing 4, 320-335.
5. G. DAHL and B. REALFSEN, 1996. Curve Approximation Constrained Shortest Path Problems, Report 6, Institute of Informatics, University of Oslo, Norway.
6. G. DAHL, 1997. The 2-Hop Spanning Tree Problem, Report 250, Institute of Informatics, University of Oslo, Norway.
7. G. EPPEN and R. MARTIN, 1987. Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition, Operations Research 35, 832-848.
8. A. GEOFFRION, 1974. Lagrangean Relaxation for Integer Programming, Mathematical Programming Study 2, 82-114.
9. L. GOUVEIA, 1995. Using the Miller-Tucker-Zemlin Constraints to Formulate Minimal Spanning Trees with Hop Constraints, Computers and Operations Research 22, 959-970.
10. L. GOUVEIA, 1996. Multicommodity Flow Models for Spanning Trees with Hop Constraints, European Journal of Operational Research 95, 178-190.
11. L. HALL, 1996. Experience with a Cutting Plane Approach for the Capacitated Spanning Tree Problem, INFORMS Journal on Computing 8, 219-234.
12. M. HELD, P. WOLFE, and H. CROWDER, 1974. Validation of Subgradient Optimization, Mathematical Programming 6, 62-66.
13. F. HWANG, D. RICHARDS, and P. WINTER, 1992. The Steiner Tree Problem, North Holland, Amsterdam.
14. R. KARP, 1972. Reducibility among Combinatorial Problems, in Complexity of Computer Computations, R. Miller, and J. Tatcher (eds). Plenum, New York.
15. E. LAWLER, 1976. Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York.
16. L. LEBLANC and R. REDDOCH, 1990. Reliable Link Topology/Capacity Design and Routing in Backbone Telecommunication Networks, paper presented at the First ORSA Telecommunications SIG Conference 'Operations Research in Telecommunications.'
17. L. LEBLANC, R. REDDOCH, J. CHIFFLET, and P. MAHEY, 1996. Routing in Telecommunications Networks with Flow Restrictions, Working paper, Vanderbilt University, Nashville, TN.
18. A. LIM, S. CHENG, and C. WU, 1993. Performance Oriented Rectilinear Steiner Trees, ELEKTRIK 1, 137-151.
19. W. LIU, 1990. A Lower Bound for the Steiner Tree Problem in Directed Graphs, Networks 20, 765-778.
20. A. LUCENA and J. BEASLEY, 1996. Branch and Cut Algorithms, in Advances in Linear and Integer Programming, J. Beasley (ed.), Oxford Lecture Series in Mathematics and its Applications, 187-222.
21. N. MACULAN, 1986. A New Linear Programming Formulation for the Shortest s-Directed Spanning Tree Problem, Journal of Combinatorics, Information and System Sciences 11, 53-56.
22. T. MAGNANTI and L. WOLSEY, 1995. Optimal Trees, in 'Network Models', Handbooks in Operations Research and Management Science 7, 503-615.
23. P. MANYEM and M. STALLMANN, 1996. Some Approximation Results in Multicasting, Working paper, North Carolina State University.
24. R. MARTIN, 1987. Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition, Operations Research 35, 820-831.
25. C. MILLER, A. TUCKER, and R. ZEMLIN, 1960. Integer Programming Formulations and Traveling Salesman Problems, Journal of ACM 7, 326-329.
26. S. VOSS, 1990. Steiner-Probleme in Graphen, Mathematical Systems in Economics 120, Anton Hain Verlag, Karlsruhe, Germany.
27. S. VOSS, 1996. The Steiner Tree Problem with Hop Constraints, paper presented at Symposium on Combinatorial Optimization, Imperial College, London, March 1996.
28. K. WOOLSTON and S. ALBIN, 1988. The Design of Centralized Networks with Reliability and Availability Constraints, Computers and Operations Research 15, 207-217.