Show simple item record

hal.structure.identifierDepartment of Mathematics and Statistics [Melbourne]
dc.contributor.authorAKARTUNALI, Kerem
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorMILLER, Andrew J.
dc.date.accessioned2024-04-04T02:38:15Z
dc.date.available2024-04-04T02:38:15Z
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/190858
dc.description.abstractEnIn this paper, we analyze a variety of approaches to obtain lower bounds for multilevel production planning problems with big bucket capacities, i.e., problems in which multiple items compete for the same resources. We give an extensive survey of both known and new methods, and also establish relationships between some of these methods that, to our knowledge, have not been presented before. As will be highlighted, understanding the substructures of difficult problems provides valuable insights on why these problems are hard to solve. We conclude with computational results from widely used test sets and discussion of future research.
dc.language.isoen
dc.title.enA Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems
dc.typeDocument de travail - Pré-publication
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
hal.identifierhal-00387105
hal.version1
hal.audienceNon spécifiée
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00387105v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=AKARTUNALI,%20Kerem&MILLER,%20Andrew%20J.&rft.genre=preprint


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record