Stefan Van Aelst Ghent University
Ingrid Van Keilegom KU Leuven
In operations research, a challenging research area is combinatorial optimization. Next to exact methods such as branch-and-bound, branch-and-price, also approximation algorithms are studied. Assignment and scheduling problems, winner determination problems and research on client-oriented vehicle routing problems are some of the subjects under study. Further emphasis is placed on machine scheduling, resource-constrained project planning and ...