论文信息 - An integer programming formulation of the Steiner problem in graphs - 字舞流文

An integer programming formulation of the Steiner problem in graphs

A succinct integer linear programming model for the Steiner problem in networks is presented.

Ján Plesník | Mamadi Diané

[1] Thomas L. Magnanti,et al. Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[2] Yash P. Aneja,et al. An integer linear programming approach to the steiner problem in graphs , 1980, Networks.

[3] Dana S. Richards,et al. Steiner tree problems , 1992, Networks.

[4] John E. Beasley. An algorithm for the steiner problem in graphs , 1984, Networks.

[5] Richard T. Wong,et al. A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[6] David K. Smith,et al. Mathematical Programming: Theory and Algorithms , 1986 .

[7] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.

[8] Anjani Jain. Probabilistic analysis of an lp relaxation bound for the steiner problem in networks , 1989, Networks.