Mostrar el registro sencillo del ítem

Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints

hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorCLAUTIAUX, François
hal.structure.identifierLaboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 [LAMIH]
dc.contributor.authorHANAFI, Said
hal.structure.identifierLille économie management - UMR 9221 [LEM]
dc.contributor.authorMACEDO, Rita
hal.structure.identifierCentre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
dc.contributor.authorVOGE, Marie-Emilie
hal.structure.identifierUniversidade do Minho = University of Minho [Braga]
dc.contributor.authorALVES, Cláudio
dc.date.accessioned2024-04-04T02:45:01Z
dc.date.available2024-04-04T02:45:01Z
dc.date.issued2017-04
dc.date.conference2016-05
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/191433
dc.description.abstractEnThis paper develops a general solution framework based on aggregation techniques to solve NP-Hard problems that can be formulated as a circulation model with specific side constraints. The size of the extended Mixed Integer Linear Programming formulation is generally pseudo-polynomial. To efficiently solve exactly these large scale models, we propose a new iterative aggregation and disaggregation algorithm. At each iteration, it projects the original model onto an aggregated one, producing an approximate model. The process iterates to refine the current aggregated model until the opti-mality is proved. The computational experiments on two hard optimization problems (a variant of the vehicle routing problem and the cutting-stock problem) show that a generic implementation of the proposed framework allows us to out-perform previous known methods.
dc.language.isoen
dc.title.enIterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]
bordeaux.page467-477
bordeaux.volume258
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.issue2
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleISCO 2016, International Symposium on Combinatorial Optimization
bordeaux.countryIT
bordeaux.conference.cityVietri sul Mare
bordeaux.peerReviewedoui
hal.identifierhal-03384513
hal.version1
hal.invitednon
hal.proceedingsoui
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-03384513v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2017-04&rft.volume=258&rft.issue=2&rft.spage=467-477&rft.epage=467-477&rft.au=CLAUTIAUX,%20Fran%C3%A7ois&HANAFI,%20Said&MACEDO,%20Rita&VOGE,%20Marie-Emilie&ALVES,%20Cl%C3%A1udio&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem