The following pages link to Antoon W. J. Kolen (Q684341):
Displaying 23 items.
- On the computational complexity of (maximum) shift class scheduling (Q684343) (← links)
- (Q922273) (redirect page) (← links)
- Throughput rate optimization in the automated assembly of printed circuit boards (Q922276) (← links)
- (Q1148203) (redirect page) (← links)
- Finding efficient solutions for rectilinear distance location problems efficiently (Q1148204) (← links)
- A dual algorithm for the economic lot-sizing problem (Q1175307) (← links)
- On the computational complexity of (maximum) class scheduling (Q1179005) (← links)
- License class design: Complexity and algorithms (Q1207538) (← links)
- Equidistant codes with distance 12 (Q1237755) (← links)
- The partial constraint satisfaction problem: Facets and lifting theorems (Q1306379) (← links)
- Genetic local search in combinatorial optimization (Q1317048) (← links)
- A linear description of the discrete lot-sizing and scheduling problem (Q1331608) (← links)
- Sensitivity analysis of list scheduling heuristics (Q1339396) (← links)
- Model-based inference in CHARME. (Q1342427) (← links)
- An analysis of shift class design problems (Q1342640) (← links)
- A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
- Solving covering problems and the uncapacitated plant location problem on trees (Q1838422) (← links)
- (Q2741347) (← links)
- Solving a bi-criterion cutting stock problem with open-ended demand: a case study (Q3156669) (← links)
- (Q3206316) (← links)
- Robust One-Period Option Hedging (Q3392043) (← links)
- Solving partial constraint satisfaction problems with tree decomposition (Q4785233) (← links)
- A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem (Q5422011) (← links)
