Duin C.W.

C.W. Duin

Information about the author C.W. Duin will soon be added to the site.
Found 9 papers in total
Two fast algorithms for all-pairs shortest paths
Two fast algorithms for all-pairs shortest paths
2007
In a large, dense network, the computation of the ‘distances’, i.e., the...
On the complexity of adjacent resource scheduling
On the complexity of adjacent resource scheduling
2006
We study the problem of scheduling resource(s) for jobs in an adjacent manner (ARS)....
Some inverse optimization problems under the Hamming distance
Some inverse optimization problems under the Hamming distance
2006
Given a feasible solution to a particular combinatorial optimization problem defined...
Solving group Steiner problems as Steiner problems
Solving group Steiner problems as Steiner problems
2004
The generalized spanning tree or group Steiner problem (GSP) is a generalization of...
The dynamic predicate stashing copy problem and the Steiner problem in graphs
The dynamic predicate stashing copy problem and the Steiner problem in graphs
2000
The Dynamic Predicate Stashing Copy Problem (DPSCP) is a problem about managing an...
The partial sum criterion for Steiner trees in graphs and shortest paths
The partial sum criterion for Steiner trees in graphs and shortest paths
1997
The partial sum criterion with parameter p adds up the p largest weights in the...
An addendum to the hierarchical network design problem
An addendum to the hierarchical network design problem
1996
The hierarchical network design problem is the problem to find a spanning tree of...
Minimum deviation and balanced optimization: A unified approach
Minimum deviation and balanced optimization: A unified approach
1991
Most combinatorial optimization problems have as criterion the sum of the weights in a...
An edge elimination test for the Steiner Problem in graphs
An edge elimination test for the Steiner Problem in graphs
1989
It is known that before actually solving the Steiner Problem in graphs, reduction...
Papers per page: