Thursday 25 April 2019

  • 09:30 - 9:50 Registration / Coffee

  • 09:50 - 10:00 Opening

  • 10:00 - 10:30 Jérôme De Boeck (ULB)

    Strategic bidding in Price Coupled Regions

  • 10:30 - 12:30 Silvano Martello (DEI “Guglielmo Marconi”, Alma Mater Studiorum Università di Bologna)

    Bin packing problems

    The tutorial will present an overview of models and algorithms for the one-dimensional bin packing problem. This is one of the most famous strongly NP-hard problems in combina- torial optimization. Its structure and its applications have been studied since the Thirties (Kantorovich). In the early Sixties Gilmore and Gomory introduced, for this class of prob- lems, the concept of column generation. This is one of the first problems for which, since the early Seventies, the worst-case performance of approximation algorithms was investigated. In the Eighties and Nineties lower bounds were studied and effective exact algorithms were developed. In the following years many heuristic and metaheuristic approaches have been introduced. In the 2000s, branch(-and-cut)-and-price algorithms and pseudo-polynomial formulations have been successfully used for its exact solution. Extensions to the two- and three-dimensional case will also be reviewed.

  • 12:30 - 14:00 Lunch

  • 14:00 Room keys are available at the reception desk

  • 14:00 - 14:30 Nicolas Nadisic (UMons)

    Sparse Non-Negative Least Squares with Branch and Bound

  • 14:30 - 15:00 François Moutier (UMons)

    Off-diagonal study of the Symmetric Nonnegative Matrix Factorization problem

  • 15:00 - 15:30 Martin Frohn (UCLouvain)

    Optimizing over lattices of unrooted binary trees

  • 15:30 - 16:00 Coffee Break

  • 16:00 - 16:30 Munise Kubra Sahin (KU Leuven)

    Multi-stage Stochastic Programming for Demand Response Optimization

  • 16:30 - 17:00 Reshma Chirayil Chandrasekharan (KU Leuven)

    Constructive Matheuristics: an integer programming based heuristics

  • 17:00 - 17:30 Dimitri Papadimitriou (UAntwerpen)

    Second-order method for minimizing nonconvex regularized objective

  • 19:00 Dinner

Friday 26 April 2019

  • 08:00 - 09:00 Breakfast

  • 09:00 - 09:30 Fränk Plein (ULB)

    Disjunctive cuts for linear-linear bilevel problems

  • 09:30 - 10:00 Victor Bucarey (ulb)

    The operator approach to dynamic Strong Stackelberg Equilibria

  • 10:00 - 10:30 Coffee Break

  • 10:30 - 12:30 Claudia D’Ambrosio (LIX, École Polytechnique, Palaiseau, France)

    Mixed Integer Non Linear Programming

    In this tutorial we aim at surveying on the fundamentals of theoretical and practical aspects of mixed integer non linear programming (MINLP). MINLPs are very powerful and challenging optimization problems that can represent an extremely large variety of real-world applications. The first part of the tutorial will be devoted to an introduction to MINLP in general and on algorithm for nonconvex MINLPs. In the second part, we will consider some well-structured classes of nonconvex MINLPs and introduce tailored methods solve them.

  • 12:30 - 14:00 Lunch

  • 14:00 - 14:30 Hatice Çalık (KU Leuven)

    A mathematical programming approach to the vehicle routing problem with cargo safety and multi-drop constraints

  • 14:30 - 15:00 Fan Yang (KU Leuven)

    Scheduling hybrid flow shops with time windows

  • 15:00 - 15:30 Farzaneh Karami (KU Leuven)

    Multi-commodity quickest path-based and flow-based formulation for conveyor operation modeling and optimization

  • 15:30 Coffee Break / End of the meeting