Skip to Main content Skip to Navigation
Conference papers

Bin Packing Problem with Generalized Time Lags: A Branch-Cut-and-Price Approach

François Clautiaux 1 Ruslan Sadykov 1 Orlando Rivera-Letelier 2
1 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
2 Universidad Adolfo Ibáñez [Santiago]
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
https://hal.inria.fr/hal-02378993
Contributor : Ruslan Sadykov <>
Submitted on : Monday, November 25, 2019 - 2:43:55 PM
Last modification on : Monday, November 16, 2020 - 8:26:04 AM
Long-term archiving on: : Wednesday, February 26, 2020 - 4:33:25 PM

File

Vignette du document
Sadykov_ROADEF19BPPTLslides.pd...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02378993, version 1

Collections

UNIV-BORDEAUX | LABRI | INRIA | PLAFRIM | IMB | CNRS

Citation

François Clautiaux, Ruslan Sadykov, Orlando Rivera-Letelier. Bin Packing Problem with Generalized Time Lags: A Branch-Cut-and-Price Approach. Roadef 2019 - 20ème Congrès Annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, Feb 2019, Le Havre, France. ⟨hal-02378993⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

54

Files downloads

129

 

Contact                    Legal Notice                    Personal Data