Recent results for column generation based diving heuristics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Recent results for column generation based diving heuristics

Abstract

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.
Fichier principal
Vignette du fichier
Sadykov.pdf (291.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01425763 , version 1 (03-01-2017)

Identifiers

  • HAL Id : hal-01425763 , version 1

Cite

Ruslan Sadykov, François Vanderbeck, Artur Alves Pessoa, Eduardo Uchoa, Issam Tahiri. Recent results for column generation based diving heuristics. ColGen, May 2016, Buzios, Brazil. ⟨hal-01425763⟩

Collections

CNRS INRIA INRIA2
347 View
87 Download

Share

Gmail Facebook X LinkedIn More