 | 2002 |
| 8 |  | Arie M. C. A. Koster,
Stan P. M. van Hoesel,
Antoon W. J. Kolen:
Solving partial constraint satisfaction problems with tree decomposition.
Networks 40(3): 170-180 (2002) |
| 2000 |
| 7 |  | Olaf E. Flippo,
Antoon W. J. Kolen,
Arie M. C. A. Koster,
Robert L. M. J. van de Leensel:
A dynamic programming algorithm for the local access telecommunication network expansion problem.
European Journal of Operational Research 127(1): 189-202 (2000) |
| 1999 |
| 6 |  | Arie M. C. A. Koster,
Stan P. M. van Hoesel,
Antoon W. J. Kolen:
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition.
WG 1999: 338-349 |
| 5 |  | Arie M. C. A. Koster,
Stan P. M. van Hoesel,
Antoon W. J. Kolen:
Solving Frequency Assignment Problems via Tree-Decomposition1.
Electronic Notes in Discrete Mathematics 3: 102-105 (1999) |
| 1998 |
| 4 |  | Arie M. C. A. Koster,
Stan P. M. van Hoesel,
Antoon W. J. Kolen:
The partial constraint satisfaction problem: Facets and lifting theorems.
Oper. Res. Lett. 23(3-5): 89-97 (1998) |
| 1995 |
| 3 |  | Yves Crama,
Antoon W. J. Kolen,
Erwin Pesch:
Local Search in Combinatorial Optimization.
Artificial Neural Networks 1995: 157-174 |
| 1994 |
| 2 |  | Antoon W. J. Kolen,
Erwin Pesch:
Genetic Local Search in Combinatorial Optimization.
Discrete Applied Mathematics 48(3): 273-284 (1994) |
| 1 |  | Antoon W. J. Kolen,
A. H. G. Rinnooy Kan,
C. P. M. van Hoesel,
Albert P. M. Wagelmans:
Sensitivity Analysis of List Scheduling Heuristics.
Discrete Applied Mathematics 55(2): 145-162 (1994) |