Antoon W. J. Kolen

According to our database1, Antoon W. J. Kolen authored at least 15 papers between 1977 and 2006.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2006
Robust One-Period Option Hedging.
Oper. Res., 2006

2002
Solving partial constraint satisfaction problems with tree decomposition.
Networks, 2002

2000
Solving a bi-criterion cutting stock problem with open-ended demand: a case study.
J. Oper. Res. Soc., 2000

A dynamic programming algorithm for the local access telecommunication network expansion problem.
Eur. J. Oper. Res., 2000

1999
Solving Frequency Assignment Problems via Tree-Decomposition<sup>1</sup>.
Electron. Notes Discret. Math., 1999

Optimal Solutions for Frequency Assignment Problems via Tree Decomposition.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998
The partial constraint satisfaction problem: Facets and lifting theorems.
Oper. Res. Lett., 1998

1995
Local Search in Combinatorial Optimization.
Proceedings of the Artificial Neural Networks: An Introduction to ANN Theory and Practice, 1995

1994
Genetic Local Search in Combinatorial Optimization.
Discret. Appl. Math., 1994

Sensitivity Analysis of List Scheduling Heuristics.
Discret. Appl. Math., 1994

1992
Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case.
Oper. Res., 1992

1987
Vehicle Routing with Time Windows.
Oper. Res., 1987

1985
The Round-Trip <i>p</i>-Center and Covering Problem on a Tree.
Transp. Sci., 1985

1981
Technical Note - Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem.
Oper. Res., 1981

1977
Equidistant codes with distance 12.
Discret. Math., 1977


  Loading...