✦ LIBER ✦

The Euclidean Steiner tree problem in Rn: A mathematical programming formulation

✍ Scribed by Nelson Maculan; Philippe Michelon; Adilson E. Xavier

Book ID: 110379269
Publisher: Springer US
Year: 2000
Tongue: English
Weight: 110 KB
Volume: 96
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018903619285

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Euclidean Bottleneck Full Steiner Tr

The Euclidean Bottleneck Full Steiner Tree Problem

✍ Abu-Affash, A. Karim 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 555 KB

On the history of the Euclidean Steiner

On the history of the Euclidean Steiner tree problem

✍ Brazil, Marcus; Graham, Ronald L.; Thomas, Doreen A.; Zachariasen, Martin 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 617 KB

Approximation algorithm for bottleneck S

Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane

✍ Zi-Mao Li; Da-Ming Zhu; Shao-Han Ma 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 339 KB

An integer programming formulation of th

An integer programming formulation of the Steiner problem in graphs

✍ Mamadi Diané; Ján Plesník 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 179 KB

An approximation algorithm for a bottlen

An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane

✍ Lusheng Wang; Zimao Li 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 95 KB

We study a bottleneck Steiner tree problem: given a set P = {p 1 , p 2 , . . . , p n } of n terminals in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. The problem has applications in

A Dynamic Adaptive Relaxation Scheme App

A Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem

✍ Chapeau-Blondeau, François; Janez, Fabrice; Ferrier, Jean-Louis 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 282 KB