Duin Cees

Cees Duin

Information about the author Cees Duin will soon be added to the site.
Found 7 papers in total
A branch-checking algorithm for all-pairs shortest paths
A branch-checking algorithm for all-pairs shortest paths
2004
We formulate and study an algorithm for all-pairs shortest paths in a network with n...
Looking ahead with the pilot method
Looking ahead with the pilot method
2005
The pilot method as a meta-heuristic is a tempered greedy method aimed at obtaining...
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
1999
As a metaheuristic to obtain solutions of enhanced quality, we formulate the so-called...
Efficient path and vertex exchange in Steiner tree algorithms
Efficient path and vertex exchange in Steiner tree algorithms
1997
Steiner's problem in a weighted graph requires a tree of minimum total weight spanning...
Heuristic methods for the rectilinear Steiner arborescence problem
Heuristic methods for the rectilinear Steiner arborescence problem
1993
In the rectilinear Steiner arborescence problem a minimum cost arborescence spanning a...
The multi-weighted Steiner tree problem
The multi-weighted Steiner tree problem
1991
The authors formulate and investigate the Multi-Weighted Steiner Problem (MWS), a...
Reducing the Hierarchical Network Design Problem
Reducing the Hierarchical Network Design Problem
1989
The Hierarchical Network Design Problem (HNDP) can be seen as a minimum spanning tree...
Papers per page: