Detailed schedule

• Educational timetabling, an overview of a mature research domain
  Peter Demeester (KaHo Sint-Lieven)
  Co-authors: G. Vanden Berghe, P. De Causmaecker
  
• Educational course timetabling: a case study
  Herman Crauwels (campus De Nayer, Hogeschool voor Wetenschap & Kunst)
  
• A hyper-heuristics approach to solve a real-world and a benchmark examination timetabling problem
  Peter Demeester (KaHo Sint-Lieven)
  
• The carry-over effect does not exist in football
  Dries Goossens (Katholieke Universiteit Leuven)
  Co-authors: F.C.R. Spieksma
  

• Incorporating logistics decisions in activity-based freight modeling
  Tabitha Maes (Hasselt University)
  Co-authors: Katrien Ramaekers, An Caris, Tom Bellemans, Gerrit Janssens
  
• A GRASP metaheuristic for allocating resources to improve the accessibility in a road network after a natural disaster
  Pablo Andres Maya Duque (University of Antwerp )
  Co-authors: K. Sorensen, P. Goos
  
• Vehicle loading optimization with stochastic supply
  Thierry Pironet (Université de Liège)
  Co-authors: Amand, Arda, Crama, Kronus, Pironet
  
• Location and market area of rail-road terminals
  Sabine Limbourg (HEC-ULg)
  Co-authors: B. Jourquin
  

• Transmission Expansion Planning with Re-design
  Michael Poss (Université Libre de Bruxelles)
  Co-authors: L.S. Moulin, C. Sagastizabal
  Abstract:
  Expanding an electrical transmission network requires heavy investments that need to be carefully planned, often at a regional or national level. We study relevant theoretical and practical aspects of transmission expansion planning, set as a bilinear programming problem with mixed 0-1 variables. We show that the problem is NP-hard and that, unlike the so-called Network Design Problem, a transmission network may become more efficient after cutting-off some of its circuits. For this reason, we introduce a new model that, rather than just adding capacity to the existing network, also allows for the network to be re-designed when it is expanded. We then turn into different reformulations of the problem, that replace the bilinear constraints by using a ``big-M'' approach. We show that computing the minimal values for the ``big-M'' coefficients involves finding the shortest and longest paths between two buses. We assess our theoretical results by making a thorough computational study on real electrical networks. The comparison of various models and reformulations shows that our new model, allowing for re-design, can lead to sensible cost reductions.
  
• Markov Chains to solve the Hamiltonian Cycle Problem
  Giang Nguyen (Universite Libre de Bruxelles)
  
• Independent sets and the routing and wavelength assignment problem
  Olivier Hudry (Ecole nationale supérieure des télécommunications)
  Co-authors: Lucile Belgacem, Irène Charon
  
• Design of Reliable Networks
  Megha Sharma (Indian Institute of Management Ahmedabad)
  Co-authors: D. Gosh
  

• On the best low multilinear rank approximation of higher-order tensors
  Mariya Ishteva (Université catholique de Louvain, Department of Mathematical Engineering)
  Co-authors: PA. Absil, S. Van Huffel, L. De Lathauwer
  
• Regression on fixed-rank positive semidefinite matrices: a geometric approach
  Gilles Meyer (University of Liège)
  Co-authors: Gilles Meyer, Silvère Bonnabel and Rodolphe Sepulchre
  
• Generalized Power Method for Sparse Principal Component Analysis
  Rodolphe Sepulchre (Université de Liège)
  Co-authors: Michel Journée, Peter Richtarik, Yurii Nesterov
  
• A pooling approach for the feed mixing problem
  Jannes Verstichel (KaHo Sint-Lieven)
  Co-authors: G. Vanden Berghe, H. Callens
  

• Constraint-based Very Large-Scale Neighborhoods
  Sébastien Mouthuy (Université Catholique de Louvain)
  Co-authors: Y.Deville and P.Van Hentenryck
  
• Implementation in COMET of a Traffic Engineering technique that Preserves IP Fast Reroute
  Trong Viet Ho (UCL, Belgium)
  Co-authors: Yves Deville, Olivier Bonaventure
  
• Constraint-Based Graph Matching
  Vianney Le Clément (UCLouvain)
  Co-authors: Yves Deville, Christine Solnon
  
• DynaUniversity2009
  Kevin Ghislain (ULB)
  Co-authors: B. Fortz, S. Zampelli, P. Schaus, A. Zanarini
  

• Integrating empty container allocation with vehicle routing decisions
  Kris Braekers (Universiteit Hasselt)
  Co-authors: Gerrit K. Janssens and An Caris
  
• Searching for reliable routes in case of customer demand dependence
  Patrick Schittekat (University of Antwerp)
  Co-authors: Frederik Michieks
  
• Effective routing for couriers: a divide and conquer strategy
  Joos Van Den Bergh (University of Antwerp)
  Co-authors: Kenneth Sorensen
  

• Using mixed integer programming to win a cycling game
  Jeroen Beliën (hogeschool universiteit brussel)
  Co-authors: Dries Goossens, Daam Van Reeth, Liesje De Boeck
  
• Budget Constraint in Reforestation for Sediment Flow Minimization
  Pablo Vanegas (Katholieke Universiteit Leuven)
  Co-authors: Dirk Cattrysse, Jos Van Orshoven
  
• The generalized sequential ordering problem for laser cutting toolpath generation
  Reginald Dewil (Katholieke Universiteit Leuven)
  Co-authors: Pieter Vansteenwegen, Dirk Cattrysse
  
• A real world 1D stock cutting problem: exact and heuristic algorithms
  Wim Vancroonenburg (KaHo Sint-Lieven)
  Co-authors: T. Wauters, G. Vanden Berghe
  

• Discriminative Clustering for Image Co-segmentation
  Francis Bach (INRIA - Ecole Normale Superieure)
  
• Fast Oriented Bounding Box Computation Using Particle Swarm Optimization
  Pierre Borckmans (UCL (INMA))
  Co-authors: Pierre-Antoine Absil
  
• The time-optimal helicopter trajectory is a circle segment
  Natalya Usotskaya (Maastricht University)
  Co-authors: A.Berger, A.Grigoriev
  
• BFO: a simple "brute-force" optimizer
  Philippe Toint (Fac. Universitaires Notre-Dame de la Paix)
  

• Failure Detection for the Bin-Packing Constraint
  Julien Dupuis (UCLouvain)
  Co-authors: Pierre Schaus, Yves Deville
  
• Finite Domain Modeling and Solving in the Monadic Constraint Programming Framework
  Pieter Wuille (KULeuven)
  Co-authors: Tom Schrijvers
  
• Constrained Optimum Paths Problems with LS(Graph)
  Quang Dung Pham (UCLouvain)
  Co-authors: Yves DEVILLE, Pascal van HENTENRYCK
  
• On expressing nurse rostering constraints as propositional satisfiability problems
  Tommy Messelis (KULeuven Campus Kortrijk)
  Co-authors: Stefaan Haspeslagh, Patrick De Causmaecker
  

• Dynamic Performance Measurement and Evaluation: Will Bridging Paradigms Lead to Improved System Design?
  Konstantinos Triantis (Virginia Tech/Northern Virginia Center)
  Co-authors: Warren Vaneman, Kalyan Pasupathy
  
• Measuring the Technical Efficiency of Airports in Latin America and the Caribbean
  Sergio Perelman (Université de Liège)
  Co-authors: Tomas Serebrisky
  
• Developments in Freight Modeling
  Justyna Bakowska (Hasselt University)
  Co-authors: An Caris, Katrien Ramaekers,Gerrit Janssens, Tom Bellemans
  

• Using Lagrangian relaxation to solve a dock assignment problem
  Lotte Berghman (Katholieke Universiteit Leuven)
  Co-authors: Roel Leus
  
• A Hybrid Algorithm for Bi-objective Flowshop Scheduling
  Jérémie Dubois-lacoste (IRIDIA, CoDE, Université Libre de Bruxelles)
  Co-authors: Manuel López-Ibáñez and Thomas Stützle
  
• A hybrid learning and combinatorial optimization approach for automotive maintenance scheduling
  Tony Wauters (KaHo Sint-Lieven)
  Co-authors: Jannes Verstichel, Katja Verbeeck, Greet Vanden Berghe
  
• A Variable Neighbourhood Search metaheuristic for scheduling the hot rolling operations at a steel mill
  Kenneth SÖrensen (Universiteit Antwerpen)
  Co-authors: Dirk Cattrysse
  

• Financial flow modeling for non-state pension funds
  Maria Govorun (ULB, Belgium)
  
• R&D project planning with multiple trials in uncertain environments
  Stefan Creemers (K.U.Leuven)
  Co-authors: Roel Leus
  
• Impact of Demand Unconstraining and Dependency on Airlines Revenue Performance
  Sandeep Karmarkar (India Institute of Management, Ahmedabad)
  Co-authors: G. Dutta, T. Bandyopadhyay
  

• Combining metaheuristics and exact methods to solve the multiobjective multidimensional knapsack problem
  Thibaut Lust (Faculté Polytechnique de Mons)
  Co-authors: Jacques Teghem
  
• Hyper-heuristics learning a varying set of low-level heuristics
  Mustafa Misir (KaHo Sint-Lieven - Katholieke Universiteit Leuven)
  Co-authors: Katja Verbeeck, Greet Vanden Berghe, Patrick De Causmaecker
  
• Using the PlayStation3 for speeding up metaheuristic optimization
  Sofie Van Volsem (Ghent University)
  Co-authors: S. Neirynck
  
• No-Wait Scheduling of a Single-Machine to Minimize the Maximum Lateness
  Imed Kacem (UNIVERSITY PAUL VERLAINE METZ)
  Co-authors: Hans Kellerer
  

• Aggregate production-distribution planning with shared production resources
  Wout Dullaert (University of Antwerp)
  Co-authors: B. Raa
  
• Variable Neighborhood Approaches For a Multi-Echelon Capacitated Location-Distribution Problem
  Frederic Semet (Ecole Centrale de Lille)
  Co-authors: B. Gendron, P.-V. Khuong
  
• Stackleberg game in transportation
  Guillaume Amand (Université de Liège)
  

• Regional Development in a Well-Being Economy: The Case of Lithuania
  Willem K. Brauers (University of Antwerp)
  Co-authors: R. Ginevicius, R. Bisdorff
  
• Evaluation of multi-criteria techniques for project portfolio management
  Sylvie Busschaert (University of Antwerp)
  
• Multicriteria decision making in a multi-level manpower system
  Marie-anne Guerry (Vrije Universiteit Brussel)
  
• Sensitivity analysis of the additive model in data envelopment analysis while inputs and outputs are fuzzy data
  Mahsa Faizrahnemoon (Islamic Azad University, Tehran Science and Research Branch)
  Co-authors: A. Davoodi
  

• Extra-Small Scenario Trees for Multistage Stochastic Programming
  Boris Defourny (University of Liege)
  Co-authors: Damien Ernst and Louis Wehenkel
  
• Extinction Probability of a Branching Process in a Markovian Random Environment
  Sophie Hautphenne (Université Libre de Bruxelles)
  Co-authors: Guy Latouche
  
• A clustering approach to estimate route travel time distributions
  Wouter Charle (K.U.Leuven)
  Co-authors: Francesco Viti, Chris M.J. Tampère
  

• A CLP engine for product configuration
  Dario Campagna (University of Perugia)
  
• Just-In-Time Scheduling with Constraint Programming
  Jean-noël Monette (Université catholique de Louvain)
  Co-authors: Yves Deville, Pascal Van Hentenryck
  
• Tank allocation for liquid bulk vessels using a hybrid constraint programming approach
  Rowan Van Schaeren (Antwerp Maritime Academy)
  
• Effective Estimation-based Stochastic Local Search Algorithms for Stochastic Routing Problems
  Thomas Stützle (Université Libre de Bruxelles (ULB) )
  Co-authors: Prasanna Balaprakash, Mauro Birattari, Marco Dorigo
  

• Modelling questions in nurse rostering
  Burak Bilgin (Kaho Sint-Lieven)
  Co-authors: Patrick De Causmaecker, Greet Vanden Berghe
  
• Simulation study of outpatient scheduling with unpunctual patients
  Thomas Demoor (Ghent University)
  Co-authors: Dieter Fiems and Herwig Bruneel
  
• Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning
  Céline Engelbeen (Université Libre de Bruxelles)
  Co-authors: Antje Kiesel
  
• Evaluating the impact of case mix decisions on capacity utilizations through discrete-event simulation
  Guoxuan Ma (K.U. Leuven)
  Co-authors: Erik Demeulemeester
  

• Score-based bibliometric rankings of authors
  Thierry Marchant (Ghent University)
  
• Assessing the evolution of a situation based on GIS
  Stephane Aimé Metchebon Takougang (UMONS, Faculté Polytechnique de Mons)
  Co-authors: M. Pirlot
  
• Weighted Banzhaf interaction indexes and weighted least squares
  Pierre Mathonet (University of Luxemboug, )
  Co-authors: JL. Marichal
  
• Measuring the interactions among variables of functions over the unit hypercube
  Jean-luc Marichal (University of Luxembourg)
  Co-authors: P. Mathonet
  

• Modelling data traffic performance in file servers: session-based arrivals
  Bart Feyaerts (Ghent University)
  Co-authors: Stijn De Vuyst, Sabine Wittevrongel, Herwig Bruneel
  
• Generalization of preemptive and non-preemptive priority queues
  Joris Walraevens (Ghent University - UGent)
  Co-authors: Tom Maertens. Herwig Bruneel
  
• Queueing analysis of outpatient scheduling in health care
  Stijn De Vuyst (Ghent University)
  Co-authors: Dieter Fiems (first author), Stijn De Vuyst, Herwig Bruneel.
  
• Stochastic Hybrid Simulation
  Ben Lauwens (Royal Military Academy)
  

• Fast optimization modeling with AIMMS
  Frans De Rooij (AIMMS)
  

• The mobile repairman problem: classification of existing models
  Jasmine Buré (KULeuven)
  Co-authors: Pieter Vansteenwegen, Dirk Cattrysse
  
• An integrated solution method for order batching and picking
  Birger Raa (Ghent University)
  Co-authors: W. Dullaert
  

• On detecting and enumerating chordless circuits in a digraph
  Raymond Bisdorff (University of Luxembourg)
  
• Coloring Graphs to Avoid Monochromatic Cycles
  Fabrice Talla Nobibon (Katholieke Universiteit Leuven)
  Co-authors: C. Hurkens, R. Leus, FCR. Spieksma