 | 2012 |
| 10 |  | C. W. Duin,
A. Volgenant:
On weighting two criteria with a parameter in combinatorial optimization problems.
European Journal of Operational Research 221(1): 1-6 (2012) |
| 2010 |
| 9 |  | A. Volgenant,
C. W. Duin:
On a pair of job-machine assignment problems with two stages.
Computers & OR 37(2): 334-340 (2010) |
| 8 |  | A. Volgenant,
C. W. Duin:
Improved polynomial algorithms for robust bottleneck problems with interval data.
Computers & OR 37(5): 909-915 (2010) |
| 7 |  | Hua Gong,
Lixin Tang,
C. W. Duin:
A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times.
Computers & OR 37(5): 960-969 (2010) |
| 2008 |
| 6 |  | Mao-cheng Cai,
C. W. Duin,
Xiaoguang Yang,
Jianzhong Zhang:
The partial inverse minimum spanning tree problem when weight increase is forbidden.
European Journal of Operational Research 188(2): 348-353 (2008) |
| 2007 |
| 5 |  | C. W. Duin:
Two fast algorithms for all-pairs shortest paths.
Computers & OR 34(9): 2824-2839 (2007) |
| 2006 |
| 4 |  | C. W. Duin,
A. Volgenant:
Some inverse optimization problems under the Hamming distance.
European Journal of Operational Research 170(3): 887-899 (2006) |
| 2004 |
| 3 |  | C. W. Duin,
A. Volgenant,
S. Voß:
Solving group Steiner problems as Steiner problems.
European Journal of Operational Research 154(1): 323-329 (2004) |
| 2 |  | A. Volgenant,
C. W. Duin:
On Steiner Versions of (bi)Connectivity in Network Problems.
Graphs and Combinatorics 20(2): 263-273 (2004) |
| 2000 |
| 1 |  | S. Marsman,
C. W. Duin,
A. Volgenant:
The dynamic predicate stashing copy problem and the Steiner problem in graphs.
European Journal of Operational Research 125(3): 526-534 (2000) |