Some generalizations of the steiner problem in graphs. - C. W. Duin; A. Volgenant (Networks, 1987)

Reduction tests for the steiner problem in grapsh. - C. W. Duin; A. Volgenant (Networks, 1989)

The multi-weighted Steiner tree problem. - Cees Duin; Ton Volgenant (Ann. Oper. Res., 1991)

Minimum deviation and balanced optimization: A unified approach. - C. W. Duin; A. Volgenant (Oper. Res. Lett., 1991)

Reducing the graphical Steiner problem with a sensitivity test. - Cees Duin (Network Design: Connectivity and Facilities Location, 1997)

Efficient path and vertex exchange in steiner tree algorithms. - Cees Duin; Stefan Voß 001 (Networks, 1997)

The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. - Cees Duin; Stefan Voß 001 (Networks, 1999)

The dynamic predicate stashing copy problem and the Steiner problem in graphs. - S. Marsman; C. W. Duin; A. Volgenant (Eur. J. Oper. Res., 2000)

Solving group Steiner problems as Steiner problems. - C. W. Duin; A. Volgenant; Stefan Voß 001 (Eur. J. Oper. Res., 2004)

On Steiner Versions of (bi)Connectivity in Network Problems. - A. Volgenant; C. W. Duin (Graphs Comb., 2004)

A Branch-Checking Algorithm for All-Pairs Shortest Paths. - Cees Duin (Algorithmica, 2005)

Looking Ahead with the Pilot Method. - Stefan Voß 001; Andreas Fink; Cees Duin (Ann. Oper. Res., 2005)

Some inverse optimization problems under the Hamming distance. - C. W. Duin; A. Volgenant (Eur. J. Oper. Res., 2006)

On the Complexity of Adjacent Resource Scheduling. - Cees Duin; E. Van Der Sluis (J. Sched., 2006)

Two fast algorithms for all-pairs shortest paths. - C. W. Duin (Comput. Oper. Res., 2007)

The partial inverse minimum spanning tree problem when weight increase is forbidden. - Mao-cheng Cai; C. W. Duin; Xiaoguang Yang; Jianzhong Zhang 001 (Eur. J. Oper. Res., 2008)

A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. - Hua Gong; Lixin Tang; C. W. Duin (Comput. Oper. Res., 2010)

On a pair of job-machine assignment problems with two stages. - A. Volgenant; C. W. Duin (Comput. Oper. Res., 2010)

Improved polynomial algorithms for robust bottleneck problems with interval data. - A. Volgenant; C. W. Duin (Comput. Oper. Res., 2010)

A reduction approach to the repeated assignment problem. - Daisuke Yokoya; Cees W. Duin; Takeo Yamada (Eur. J. Oper. Res., 2011)

On weighting two criteria with a parameter in combinatorial optimization problems. - C. W. Duin; A. Volgenant (Eur. J. Oper. Res., 2012)