|
|
Detailed schedule
PDF Version: overview
PDF Version: detailed program
Click on a link for more details
Show all the abstracts
Thursday 7 February:
Thursday 11:15-12:30 TA-1: COMEX Decision Making Room C.611 - Chair: B. Fortz
Thursday 11:15-12:30 TA-2: Production 1 Room C.601 - Chair: E.h. AGhezzaf
Thursday 11:15-12:30 TA-3: Global Optimization Room C.602 - Chair: D. Claeys
Thursday 11:15-12:30 TA-4: Transportation 1 Room C.603 - Chair: C. Vanovermeire
Thursday 14:00-15:40 TB-1: COMEX Health Room C.611 - Chair: G. Vanden Berghe
Thursday 14:00-15:40 TB-2: Routing Room C.601 - Chair: G.K. Janssens
Thursday 14:00-15:40 TB-3: Meta-Heuristics Room C.602 - Chair: P. Vansteenwegen
Thursday 14:00-15:40 TB-4: Transportation 2 Room C.603 - Chair: F.C.R Spieksma
Thursday 16:10-17:25 TC-1: COMEX Routing Room C.611 - Chair: K. Sôrensen
Thursday 16:10-17:25 TC-2: Sets, Relations and Rankings Room C.601 - Chair: B. De Baets
- A Set-Based Approach to the Decomposition of Linear Mixtures Using Quasi-Convex Programming (PDF)
Jan Verwaeren (Ghent University) Co-authors: Michael Rademaker, Bernard De Baets
- Dice representability of reciprocal relations (PDF)
Karel De Loof (Universiteit Gent) Co-authors: K. De Loof, B. De Baets and H. De Meyer
- Using a natural monotonicity constraint as the basis of a ranking procedure (PDF)
Michael Rademaker (UGent) Co-authors: Bernard De Baets Abstract: Consider what it means for a ranking to correspond to a group opinion, or for a ranking procedure to be appropriate. Much like in some other disciplines, there is no ground truth (automatic image annotation is another example in which the ground truth is not clearly defined). Rather, there are certain axioms that are considered as natural and desirable. On the basis of those, a methodology can be constructed. The methodology we will present is built on the idea of monotonicity: When I prefer x to y and prefer y to z, the extent to which I prefer x to z cannot be smaller than the extent to which I prefer x to y or y to z.
We consider a ranking problem where each voter has expressed a linear
order relation over the candidates. We consider a ranking procedure
that chooses as a winning ranking one which adheres best to the constraint of monotonicity: For a ranking x
Thursday 16:10-17:25 TC-3: Logistics Room C.602 - Chair: S. Demeyer
Friday 9:00-10:15 FA-1: COMEX Logistics Room C.611 - Chair: Y. Crama
- The cooperative facility location problem (PDF)
Lotte Verdonck (Hasselt University, Research Foundation Flanders (FWO)) Co-authors: Patrick Beullens, An Caris, Katrien Ramaekers, Gerrit K. Janssens
- Two- and three-dimensional strip packing: a shaking procedure (PDF)
Tony Wauters (CODeS, KAHO Sint-Lieven) Co-authors: Jannes Verstichel, Greet Vanden Berghe
- Multiperiod vehicle loading with stochastic release dates (PDF)
Thierry Pironet (University of Liège) Co-authors: Y. Arda, Y. Crama, D. Kronus, Th. Pironet, P. Van Hentenryck
Friday 9:00-10:15 FA2: Production 2 Room C.611 - Chair: D. Tuyttens
Friday 9:00-10:15 FA-3: MIP Room C.603 - Chair: T. Dokka
Friday 14:00-15:40 FB-1: COMEX automatic tuning and organization Room C.611 - Chair: T. Stützle
Friday 14:00-15:40 FB2: Disaster, Water and Biology Room C.602 - Chair: L. Porretta
Friday 14:00-15:40 FB-3: Decision Making Room C.603 - Chair: D. Goossens
|
|