• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

A branch-and-price algorithm for the temporal bin packing problem

Dell’Amico, Mauro; Furini, Fabio; Iori, Manuel (2019), A branch-and-price algorithm for the temporal bin packing problem, Computers and Operations Research, 114, p. 104825. 10.1016/j.cor.2019.104825

View/Open
Branch-and-Price.pdf (310.9Kb)
Type
Article accepté pour publication ou publié
Date
2019
Journal name
Computers and Operations Research
Volume
114
Publisher
Elsevier
Pages
104825
Publication identifier
10.1016/j.cor.2019.104825
Metadata
Show full item record
Author(s)
Dell’Amico, Mauro
Furini, Fabio
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Iori, Manuel
Abstract (EN)
We study an extension of the classical Bin Packing Problem, where each item consumes the bin capacity during a given time window that depends on the item itself. The problem asks for finding the minimum number of bins to pack all the items while respecting the bin capacity at any time instant. A polynomial-size formulation, an exponential-size formulation, and a number of lower and upper bounds are studied. A branch-and-price algorithm for solving the exponential-size formulation is introduced. An overall algorithm combining the different methods is then proposed and tested through extensive computational experiments.
Subjects / Keywords
Bin packing problem; Branch-and-price algorithm; Temporal bin packing problem

Related items

Showing items related by title and author.

  • Thumbnail
    A lexicographic pricer for the fractional bin packing problem 
    Coniglio, Stefano; D’Andreagiovanni, Fabio; Furini, Fabio (2019) Article accepté pour publication ou publié
  • Thumbnail
    Résolution du problème de bin-packing robuste par un algorithme de branch-and-price 
    Schepler, Xavier; Dolgui, Alexandre; Gurevsky, Evgeny; Rossi, André (2020) Communication / Conférence
  • Thumbnail
    An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem 
    Furini, Fabio; Gabrel, Virginie; Ternier, Ian-Christopher (2017) Article accepté pour publication ou publié
  • Thumbnail
    A new branch-and-bound algorithm for the maximum edge-weighted clique problem 
    San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; Ljubić, Ivana (2019) Article accepté pour publication ou publié
  • Thumbnail
    Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem 
    Furini, Fabio; Iori, Manuel; Martello, Silvano; Yagiura, Mutsunori (2015) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo