Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s)
Solving a lot-sizing problem by semidefinite programs and cutting planes
Celine Gicquel

26 October 2012, 10h30 - 26 October 2012, 11h30
Salle/Bat : 475/PCRI-N
Contact : celine.gicquel@lri.fr

Activités de recherche :

Résumé :
We study a combinatorial optimization problem arising in the context of industrial production planning problem, namely the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs. This optimization problem can be formulated as a quadratic binary program. In the present work, we propose to compute a lower bound of the optimal integer solution value by using a semidefinite relaxation of the problem rather than a standard linear relaxation. This is achieved by combining some reformulation techniques previously published in the semidefinite programming literature for general quadratic binary problems with an existing MILP strengthening procedure developped specifically for the problem under study. The results of the computational experiments we carried out on small instances show that the proposed approach consistently provides lower bounds of improved quality as compared with those provided by the best previously published linear relaxations. Moreover it is capable of completely closing the gap between the semidefinite relaxation and the optimal integer solution value for a significant proportion of the studied instances.

Pour en savoir plus :
Séminaires
A Two-level Auction for Resource Allocation in Mul
Réseaux sans fil et mobiles
Friday 09 March 2018 - 14h30
Salle : 445 - PCRI-N
Mira Morcos .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 09 February 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

Approximate Bayesian Computation and Random Forest
Thursday 08 February 2018 - 00h00
Salle : 455 - PCRI-N
Valentin Thouzeau .............................................

A concurrent lock-free algorithm for computing a f
Combinatoire
Friday 12 January 2018 - 14h30
Salle : 445 - PCRI-N
James Mitchell .............................................

Acyclic Partitioning of Large Directed Acyclic Gra
Calcul à haute performance
Tuesday 09 January 2018 - 10h30
Salle : 465 - PCRI-N
Julien Herrmann .............................................