Mostrar el registro sencillo del ítem

Recent results for column generation based diving heuristics

hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorSADYKOV, Ruslan
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorVANDERBECK, François
hal.structure.identifierInstituto de Computação [Niteroi-Rio de Janeiro] [IC-UFF]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorPESSOA, Artur
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierInstituto de Computação [Niteroi-Rio de Janeiro] [IC-UFF]
dc.contributor.authorUCHOA, Eduardo
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorTAHIRI, Issam
dc.date.accessioned2024-04-04T03:11:57Z
dc.date.available2024-04-04T03:11:57Z
dc.date.created2016-05-24
dc.date.issued2016-05-24
dc.date.conference2016-05-23
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/193818
dc.description.abstractEnMath 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.
dc.language.isoen
dc.title.enRecent results for column generation based diving heuristics
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleColGen
bordeaux.countryBR
bordeaux.conference.cityBuzios
bordeaux.peerReviewedoui
hal.identifierhal-01425763
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2016-05-25
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01425763v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2016-05-24&rft.au=SADYKOV,%20Ruslan&VANDERBECK,%20Fran%C3%A7ois&PESSOA,%20Artur&UCHOA,%20Eduardo&TAHIRI,%20Issam&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem