| |
| 2008 | ||
|---|---|---|
| 5 | EE | 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 | ||
| 4 | EE | C. W. Duin: Two fast algorithms for all-pairs shortest paths. Computers & OR 34(9): 2824-2839 (2007) |
| 2006 | ||
| 3 | EE | C. W. Duin, A. Volgenant: Some inverse optimization problems under the Hamming distance. European Journal of Operational Research 170(3): 887-899 (2006) |
| 2004 | ||
| 2 | EE | C. W. Duin, A. Volgenant, S. Voß: Solving group Steiner problems as Steiner problems. European Journal of Operational Research 154(1): 323-329 (2004) |
| 1 | EE | A. Volgenant, C. W. Duin: On Steiner Versions of (bi)Connectivity in Network Problems. Graphs and Combinatorics 20(2): 263-273 (2004) |
| 1 | Mao-cheng Cai | [5] |
| 2 | A. Volgenant | [1] [2] [3] |
| 3 | S. Voß | [2] |
| 4 | Xiaoguang Yang | [5] |
| 5 | Jianzhong Zhang | [5] |