SADYKOV, Ruslan; VANDERBECK, François; PESSOA, Artur; UCHOA, Eduardo; TAHIRI, Issam

Métadonnées

Licence d’utilisation du document

SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]

VANDERBECK, François
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]

PESSOA, Artur
Instituto de Computação [Niteroi-Rio de Janeiro] [IC-UFF]
Reformulations based algorithms for Combinatorial Optimization [Realopt]

Langue

Communication dans un congrès

Ce document a été publié dans

ColGen, 2016-05-23, Buzios. 2016-05-24

Résumé en anglais

Math heuristics have become an essential component in mixed integer programming (MIP) solvers. As the Dantzig-Wolfe reformulation of a problem is typically tighter than that of the original compact formulation, heuristics based on rounding its linear program- ing (LP) solution can be more competitive. We focus on the so-called diving methods that used re-optimization after each LP rounding. Our numerical results on generalized assignment, cutting stock, and vertex coloring problems sets new benchmarks, highlighting the performance of diving heuristics as generic procedures in a column generation context and producing better solutions than state-of-the-art specialized heuristics in some cases.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

Recent results for column generation based diving heuristics

Langue

Ce document a été publié dans

Résumé en anglais

URI

Origine

Unités de recherche