✦ LIBER ✦

An integer linear programming approach to the steiner problem in graphs

✍ Scribed by Y. P. Aneja

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 583 KB
Volume: 10
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230100207

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An integer programming approach to routi

An integer programming approach to routing in daisy networks

✍ Johanna Becker; Zsolt Csizmadia; Jérôme Galtier; Alexandre Laugier; Jácint Szabó 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 360 KB

An algorithm for the steiner problem in

An algorithm for the steiner problem in graphs

✍ M. L. Shore; L. R. Foulds; P. B. Gibbons 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB

An algorithm for the steiner problem in

An algorithm for the steiner problem in graphs

✍ J. E. Beasley 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 579 KB

The procurement problem: An integer prog

The procurement problem: An integer programming problem well suited to a solution using duality

✍ Eldon A. Gunn; Andrew Kusiak 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 421 KB

An SST-based algorithm for the steiner p

An SST-based algorithm for the steiner problem in graphs

✍ J. E. Beasley 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 644 KB

In this paper we consider the Steiner problem in graphs which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph. We present a formulation of the problem as a shortest spanning tree (SST) problem with additional constraints. By relaxing these addition

An integer linear programming approach t

An integer linear programming approach to data allocation with the minimum total communication cost in distributed database systems

✍ Xuemin Lin; Maria Orlowska 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 455 KB