C. W. Duin

13 papers Journal 13
YearRankTypeTitle / Venue / Authors
2012 J jnl
On weighting two criteria with a parameter in combinatorial optimization problems.
Eur. J. Oper. Res.
C. W. Duin, A. Volgenant
2010 J jnl
A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times.
Comput. Oper. Res.
Hua Gong, Lixin Tang, C. W. Duin
2010 J jnl
Improved polynomial algorithms for robust bottleneck problems with interval data.
Comput. Oper. Res.
A. Volgenant, C. W. Duin
2010 J jnl
On a pair of job-machine assignment problems with two stages.
Comput. Oper. Res.
A. Volgenant, C. W. Duin
2008 J jnl
The partial inverse minimum spanning tree problem when weight increase is forbidden.
Eur. J. Oper. Res.
Mao-cheng Cai, C. W. Duin, Xiaoguang Yang, Jianzhong Zhang
2007 J jnl
Two fast algorithms for all-pairs shortest paths.
Comput. Oper. Res.
C. W. Duin
2006 J jnl
Some inverse optimization problems under the Hamming distance.
Eur. J. Oper. Res.
C. W. Duin, A. Volgenant
2004 J jnl
On Steiner Versions of (bi)Connectivity in Network Problems.
Graphs Comb.
A. Volgenant, C. W. Duin
2004 J jnl
Solving group Steiner problems as Steiner problems.
Eur. J. Oper. Res.
C. W. Duin, A. Volgenant, Stefan Voß
2000 J jnl
The dynamic predicate stashing copy problem and the Steiner problem in graphs.
Eur. J. Oper. Res.
S. Marsman, C. W. Duin, A. Volgenant
1991 J jnl
Minimum deviation and balanced optimization: A unified approach.
Oper. Res. Lett.
C. W. Duin, A. Volgenant
1989 J jnl
Reduction tests for the steiner problem in grapsh.
Networks
C. W. Duin, A. Volgenant
1987 J jnl
Some generalizations of the steiner problem in graphs.
Networks
C. W. Duin, A. Volgenant