• 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 - Request a copy

A lexicographic pricer for the fractional bin packing problem

Coniglio, Stefano; D’Andreagiovanni, Fabio; Furini, Fabio (2019), A lexicographic pricer for the fractional bin packing problem, Operations Research Letters, 47, 6, p. 622-628. 10.1016/j.orl.2019.10.011

Type
Article accepté pour publication ou publié
Date
2019
Journal name
Operations Research Letters
Volume
47
Number
6
Publisher
Elsevier
Pages
622-628
Publication identifier
10.1016/j.orl.2019.10.011
Metadata
Show full item record
Author(s)
Coniglio, Stefano
University of Southampton - Mathematical Sciences
D’Andreagiovanni, Fabio cc
Heuristique et Diagnostic des Systèmes Complexes [Compiègne] [Heudiasyc]
Furini, Fabio
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
We propose an exact lexicographic dynamic programming pricing algorithm for solving the Fractional Bin Packing Problem with column generation. The new algorithm is designed for generating maximal columns of minimum reduced cost which maximize, lexicographically, one of the measures of maximality we investigate. Extensive computational experiments reveal that a column generation algorithm based on this pricing technique can achieve a substantial reduction in the number of columns and the computing time, also when combined with a classical smoothing technique from the literature.
Subjects / Keywords
Fractional bin packing problem; Column generation; Dynamic programming; Lexicographic optimization

Related items

Showing items related by title and author.

  • Thumbnail
    A branch-and-price algorithm for the temporal bin packing problem 
    Dell’Amico, Mauro; Furini, Fabio; Iori, Manuel (2019) Article accepté pour publication ou publié
  • Thumbnail
    An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem 
    Furini, Fabio; Ljubić, Ivana; Sinnl, Markus (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
    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
    Solving robust bin-packing problems with a branch-and-price approach 
    Schepler, Xavier; Rossi, André; Gurevsky, Evgeny; Dolgui, Alexandre (2020) 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