This paper considers the problem of designing districts for vehicle routing problems with stochastic demands. In particular, demands are assumed to be uncertain at the time when t...
This paper addresses the jobshop and the flowshop scheduling problems with minimum and maximum time lags. To solve this kind of problems, we propose adaptations of Climbing Discre...
In this paper we show and discuss a family of inequalities for solving a variant of the classical vehicle routing problem where also a lower bound is considered. The inequalities ...
The aim of this study was to assess the retrieval effectiveness of nursing students in the Dutch-speaking part of Belgium. We tested two groups: students from the master Nursing a...
Klaar Vanopstal, Robert Vander Stichele, Godelieve...
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...