HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
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 Connect in order to contact the contributor
Submitted on : Monday, November 25, 2019 - 2:43:55 PM
Last modification on : Friday, January 21, 2022 - 3:11:49 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 | INRIA2 | INRIA | PLAFRIM | CNRS | INRIA-CHILE

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 Datacite

Share

Metrics

Record views

26

Files downloads

72

 

Contact                    Legal Notice                    Personal Data