Show simple item record

dc.contributor.authorDell’Amico, Mauro
hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorFurini, Fabio
dc.contributor.authorIori, Manuel
dc.date.accessioned2022-02-25T08:22:57Z
dc.date.available2022-02-25T08:22:57Z
dc.date.issued2019
dc.identifier.issn0305-0548
dc.identifier.urihttps://basepub.dauphine.psl.eu/handle/123456789/22748
dc.language.isoenen
dc.subjectBin packing problemen
dc.subjectBranch-and-price algorithmen
dc.subjectTemporal bin packing problemen
dc.subject.ddc004en
dc.titleA branch-and-price algorithm for the temporal bin packing problemen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenWe 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.en
dc.relation.isversionofjnlnameComputers and Operations Research
dc.relation.isversionofjnlvol114en
dc.relation.isversionofjnldate2020-02
dc.relation.isversionofjnlpages104825en
dc.relation.isversionofdoi10.1016/j.cor.2019.104825en
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelInformatique généraleen
dc.relation.forthcomingnonen
dc.description.ssrncandidatenon
dc.description.halcandidatenonen
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2022-02-25T08:20:28Z
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record