Kolen, A. J. W.
Kolen, A.W.J. (Anthonius Wilhelmus Johannes)
Kolen, A.W.J.
Kolen, Anthonius Wilhelmus Johannes.
Antoon Kolen
Kolen, Antoon W. J.
VIAF ID: 93125843 (Personal)
Permalink: http://viaf.org/viaf/93125843
Preferred Forms
-
100 0 _
‡a
Antoon Kolen
-
100 1 _ ‡a Kolen, A. J. W (sparse)
-
100 1 _ ‡a Kolen, A. J. W.
-
100 1 0
‡a
Kolen, A. J. W.
-
100 1 _ ‡a Kolen, A. J. W.
-
100 1 _
‡a
Kolen, A. J. W.
(sparse)
-
100 1 _
‡a
Kolen, A.W.J.
-
100 1 _ ‡a Kolen, A.W.J. ‡q (Anthonius Wilhelmus Johannes)
-
100 1 _ ‡a Kolen, Anthonius Wilhelmus Johannes.
-
100 1 _
‡a
Kolen, Antoon W. J.
4xx's: Alternate Name Forms (8)
Works
| Title | Sources |
|---|---|
| An analysis of shift class design problems |
|
| Combinatorics in operations research |
|
| Complexity of location problems on networks |
|
| Contraint propagation in charme |
|
| Duality and the nonlinear round-trip -center and covering problems on a tree : (preprint) |
|
| Economic lot-sizing: an O(n log n)-algorithm that runs in linear time in the Wagner-Whitin case |
|
| A general framework for shortest path algorithms |
|
| Inleiding lineaire en niet-lineaire programmering |
|
| Interactieve routeplanning van bulktransport : een praktijktoepassing |
|
| License class design: complexity and algorithms |
|
| A linear description of the discrete lot-sizing and scheduling problem |
|
| Lower bounds for minimum interference frequency assignment problems |
|
| More results concerning license class design |
|
| Een naald in een hooiberg |
|
| On the computational complexity of (maximum) shift class scheduling |
|
| The partial constraint satisfaction problem: facets and lifting theorems |
|
| A polynomial algorithm for the linear ordering problem with weights in product form |
|
| A polynomial-time algorithm for solving the set covering problem on a totaly-balanced matrix |
|
| Sensitivity analysis of list scheduling heuristics |
|
| Solving a bi-criterion cutting stock problem: a case study |
|
| Solving covering problems and the uncapacitated plant location problem on trees |
|
| Solving frequency assignment problems via tree-decomposition |
|
| The strong perfect graph conjecture holds for coupled interval graphs |
|
| A super balanced hypergraph has a nest point |
|
| Totally-balanced and greedy matrices |
|
| Tree network and planar rectilinear location theory, 1986: |
|
