𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for solving the conditional covering problem on paths

✍ Scribed by Brian J. Lunday; J. Cole Smith; Jeffrey B. Goldberg

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
111 KB
Volume
52
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algorithms for solving a spatial optimis
Algorithms for solving a spatial optimisation problem on a parallel computer
✍ George, Felicity; Radcliffe, Nicholas; Smith, Mark; Birkin, Mark; Clarke, Martin πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 337 KB πŸ‘ 2 views

In a collaborative project between GMAP Ltd and EPCC, an existing heuristic optimisation scheme for strategic resource planning was parallelised to run on the data parallel Connection Machine CM-200. The parallel software was found to run over 2700 times faster than the original workstation software

Dual algorithms for the shortest path tr
Dual algorithms for the shortest path tree problem
✍ Pallottino, Stefano; ScutellοΏ½, Maria Grazia πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 117 KB πŸ‘ 2 views

We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution and propose a new family of dual ascent algorithms. In these algorithms, ''local'' and