𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reducing the Steiner problem in four uniform orientations

✍ Scribed by Guo-Hui Lin; Guoliang Xue


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
315 KB
Volume
35
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The local Steiner problem in normed plan
✍ Konrad J. Swanepoel πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 174 KB πŸ‘ 2 views
Tabu search for the Steiner problem in g
✍ 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

A branch and cut algorithm for the Stein
✍ Lucena, A.; Beasley, J. E. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 165 KB πŸ‘ 2 views

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 with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraint

The pilot method: A strategy for heurist
✍ Duin, Cees; VoοΏ½, Stefan πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 140 KB πŸ‘ 2 views

As a metaheuristic to obtain solutions of enhanced quality, we formulate the so-called pilot method. It is a tempered greedy method that is to avoid the greedy trap by looking ahead for each possible choice (memorizing the best result). Repeatedly, a so-called master solution is modified, each time