Interval scheduling: A survey von Kolen, Antoon W.J., Lenstra, Jan Karel, Papadimitriou, Christos H., Spieksma, Frits C.R.

Volltext

Solving partial constraint satisfaction problems with tree decomposition von Koster, Arie M. C. A., van Hoesel, Stan P. M., Kolen, Antoon W. J.

Volltext

On the computational complexity of (maximum) shift class scheduling von Kolen, Antoon W.J., Kroon, Leo G.

Volltext

On the computational complexity of (maximum) class scheduling von Kolen, Antoon W.J., Kroon, Leo G.

Volltext

License class design: complexity and algorithms von Kolen, Antoon W.J., Kroon, Leo G.

Volltext

A dynamic programming algorithm for the local access telecommunication network expansion problem von Flippo, Olaf E., Kolen, Antoon W.J., Koster, Arie M.C.A., van de Leensel, Robert L.M.J.

Volltext

Vehicle Routing with Time Windows von Kolen, A. W. J, Rinnooy Kan, A. H. G, Trienekens, H. W. J. M

Volltext

A dynamic programming algorithm for the local access telecommunications network expansion problem von Flippo, Olaf E, Kolen, Antoon W J, Arie M C A Koster, Robert L M J van de Leensel

Volltext

An analysis of shift class design problems von Kolen, Antoon W.J., Kroon, Leo G.

Volltext

The Round-Trip p-Center and Covering Problem on a Tree von Kolen, Antoon

Volltext

The partial constraint satisfaction problem: Facets and lifting theorems von Koster, Arie M.C.A., Hoesel, Stan P.M.van, Kolen, Antoon W.J.

Volltext

Optimal Solutions for Frequency Assignment Problems via Tree Decomposition von Koster, Arie M. C. A., van Hoesel, Stan P.M., Kolen, Antoon W.J.

Volltext