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
Some recent results on the integer linear programm
Théorie des graphes
Friday 30 November 2018 - 00h00
Salle : 445 - PCRI-N
Hung Nguyen .............................................

Maximum Independent Set in H-free graphs
Théorie des graphes
Friday 05 October 2018 - 14h30
Salle : 445 - PCRI-N
Edouard BONNET .............................................

A Family of Tractable Graph Distances
Gestion de données du Web
Wednesday 04 July 2018 - 10h30
Salle : 465 - PCRI-N
Stratis Ioannidis .............................................

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

Distributionally Robust Optimization with Principa
Optimisation combinatoire et stochastique
Friday 29 June 2018 - 11h00
Salle : 455 - PCRI-N
Dr. Jianqiang Cheng .............................................