Antoon W. J. Kolen

Available identifiers

zbMath Open kolen.antoon-w-jWikidataQ18926955 ScholiaQ18926955MaRDI QIDQ684341

List of research outcomes

Publication	Date of Publication	Type
Robust One-Period Option Hedging	2009-08-13	Paper
Interval scheduling: A survey	2008-09-12	Paper
A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem	2007-10-26	Paper
Solving a bi-criterion cutting stock problem with open-ended demand: a case study	2005-01-10	Paper
Solving partial constraint satisfaction problems with tree decomposition	2002-12-17	Paper
https://portal.mardi4nfdi.de/entity/Q2741347	2001-09-23	Paper
A dynamic programming algorithm for the local access telecommunication network expansion problem	2000-12-21	Paper
Model-based inference in CHARME.	2000-06-21	Paper
The partial constraint satisfaction problem: Facets and lifting theorems	1998-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4871783	1997-01-19	Paper
Sensitivity analysis of list scheduling heuristics	1995-10-10	Paper
An analysis of shift class design problems	1995-05-30	Paper
A linear description of the discrete lot-sizing and scheduling problem	1994-08-21	Paper
Genetic local search in combinatorial optimization	1994-03-24	Paper
On the computational complexity of (maximum) shift class scheduling	1993-09-15	Paper
License class design: Complexity and algorithms	1993-04-01	Paper
Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case	1992-06-28	Paper
On the computational complexity of (maximum) class scheduling	1992-06-26	Paper
A dual algorithm for the economic lot-sizing problem	1992-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q3971521	1992-06-25	Paper
Throughput rate optimization in the automated assembly of printed circuit boards	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3476606	1989-01-01	Paper
Polyhedral Combinatorics in Combinatorial Optimization	1987-01-01	Paper
Vehicle Routing with Time Windows	1987-01-01	Paper
Totally-Balanced and Greedy Matrices	1985-01-01	Paper
The Round-Trip p-Center and Covering Problem on a Tree	1985-01-01	Paper
Solving covering problems and the uncapacitated plant location problem on trees	1983-01-01	Paper
Finding efficient solutions for rectilinear distance location problems efficiently	1981-01-01	Paper
Technical Note—Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3928262	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3879274	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3206316	1979-01-01	Paper
Equidistant codes with distance 12	1977-01-01	Paper

Research outcomes over time

This page was built for person: Antoon W. J. Kolen