Antoon W. J. Kolen

Publication Activity (10 Years)

Years Active: 1977-2006
Publications (10 Years): 0

Publications

Frank Lutgens, Jos F. Sturm, Antoon W. J. Kolen
Robust One-Period Option Hedging. Oper. Res. 54 (6) (2006)
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) (2002)
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. Eur. J. Oper. Res. 127 (1) (2000)
Antoon W. J. Kolen, Frits C. R. Spieksma
Solving a bi-criterion cutting stock problem with open-ended demand: a case study. J. Oper. Res. Soc. 51 (11) (2000)
Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
. Electron. Notes Discret. Math. 3 (1999)
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)
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) (1998)
Yves Crama, Antoon W. J. Kolen, Erwin Pesch
Local Search in Combinatorial Optimization. Artificial Neural Networks (1995)
Antoon W. J. Kolen, A. H. G. Rinnooy Kan, C. P. M. van Hoesel, Albert P. M. Wagelmans
Sensitivity Analysis of List Scheduling Heuristics. Discret. Appl. Math. 55 (2) (1994)
Antoon W. J. Kolen, Erwin Pesch
Genetic Local Search in Combinatorial Optimization. Discret. Appl. Math. 48 (3) (1994)
Albert P. M. Wagelmans, Stan P. M. van Hoesel, Antoon W. J. Kolen
Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case. Oper. Res. 40 (Supplement-1) (1992)
Antoon W. J. Kolen, A. H. G. Rinnooy Kan, Harry W. J. M. Trienekens
Vehicle Routing with Time Windows. Oper. Res. 35 (2) (1987)
Antoon W. J. Kolen
-Center and Covering Problem on a Tree. Transp. Sci. 19 (3) (1985)
Antoon W. J. Kolen
Technical Note - Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem. Oper. Res. 29 (3) (1981)
J. I. Hall, A. J. F. M. Jansen, Antoon W. J. Kolen, Jack H. van Lint
Equidistant codes with distance 12. Discret. Math. 17 (1) (1977)