• Antoon Kolen.
Location Problems on Trees and in the Rectilinear Plane. PhD thesis, Universiteit van Amsterdam, 1982. • Kolen, Antoon WJ, and Arie Tamir.
Covering problems. Econometric Institute, 1984. Articles, a selection: •
Brouwer, Andries E., and Antoon WJ Kolen. "A super-balanced hypergraph has a nest point."
Stichting Mathematisch Centrum. Zuivere Wiskunde ZW 146/80 (1980): 1-7. • Hoffman, Alan J., A. W. J. Kolen, and Michel Sakarovitch. "Totally-balanced and greedy matrices."
SIAM Journal on Algebraic and Discrete Methods 6.4 (1985): 721-730. • Kolen, Antoon WJ,
A. H. G. Rinnooy Kan, and H. W. J. M. Trienekens. "Vehicle routing with time windows." Operations Research 35.2 (1987): 266-273. •
Wagelmans, Albert,
Stan Van Hoesel, and Antoon Kolen. "Economic lot sizing: an O (n log n) algorithm that runs in linear time in the Wagner-Whitin case."
Operations Research 40.1-Supplement - 1 (1992): pp. 145–156. • Koster, Arie MCA,
Stan P.M. Van Hoesel, and Antoon WJ Kolen. "The partial constraint satisfaction problem: Facets and lifting theorems."
Operations research letters 23.3 (1998): 89-97. • Kolen, Antoon. "A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem."
Statistica Neerlandica 61.1 (2007): 4-15. == References ==