✦ LIBER ✦

Reduction tests for the steiner problem in grapsh

✍ Scribed by C. W. Duin; A. Volgenant

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 888 KB
Volume: 19
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230190506

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reduction tests for the prize-collecting

Reduction tests for the prize-collecting Steiner problem

✍ Eduardo Uchoa 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Reductions for the rectilinear steiner t

Reductions for the rectilinear steiner tree problem

✍ Pawel Winter 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 842 KB

Steiner polygons in the Steiner problem

✍ Jia Feng Weng 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 459 KB

The steiner problem in graphs

✍ S. E. Dreyfus; R. A. Wagner 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 567 KB

Tabu search for the Steiner problem in g

Tabu search for the Steiner problem in graphs

✍ Celso C. Ribeiro; Maurício C. De Souza 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 2 views

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o

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