Mostrar el registro sencillo del ítem
An iterative dynamic programming approach for the temporal knapsack problem
hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
dc.contributor.author | CLAUTIAUX, François | |
hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
dc.contributor.author | DETIENNE, Boris | |
hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
dc.contributor.author | GUILLOT, Gaël | |
dc.date.accessioned | 2024-04-04T02:46:15Z | |
dc.date.available | 2024-04-04T02:46:15Z | |
dc.date.issued | 2021-09-01 | |
dc.identifier.issn | 0377-2217 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/191534 | |
dc.description.abstractEn | In this paper, we address the temporal knapsack problem (TKP). In this generalization of the classical knapsack problem, selected items enter and leave the knapsack at fixed dates. We solve the TKP with a dynamic program of exponential size, which is solved using a method called Successive Sublimation Dynamic Programming (SSDP). This method starts by relaxing a set of constraints from the initial problem, and iteratively reintroduces them when needed. We show that a direct application of SSDP to the temporal knapsack problem does not lead to an effective method, and that several improvements are needed to compete with the best results from the literature. | |
dc.language.iso | en | |
dc.publisher | Elsevier | |
dc.subject.en | Temporal knapsack | |
dc.subject.en | Exact algorithm | |
dc.subject.en | Lagrangian Relaxation | |
dc.subject.en | Successive Sublimation Dynamic Programming method | |
dc.title.en | An iterative dynamic programming approach for the temporal knapsack problem | |
dc.type | Article de revue | |
dc.identifier.doi | 10.1016/j.ejor.2020.12.036 | |
dc.subject.hal | Mathématiques [math]/Optimisation et contrôle [math.OC] | |
bordeaux.journal | European Journal of Operational Research | |
bordeaux.volume | 293 | |
bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
bordeaux.issue | 2 | |
bordeaux.institution | Université de Bordeaux | |
bordeaux.institution | Bordeaux INP | |
bordeaux.institution | CNRS | |
bordeaux.peerReviewed | oui | |
hal.identifier | hal-02044832 | |
hal.version | 1 | |
hal.popular | non | |
hal.audience | Internationale | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-02044832v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=European%20Journal%20of%20Operational%20Research&rft.date=2021-09-01&rft.volume=293&rft.issue=2&rft.eissn=0377-2217&rft.issn=0377-2217&rft.au=CLAUTIAUX,%20Fran%C3%A7ois&DETIENNE,%20Boris&GUILLOT,%20Ga%C3%ABl&rft.genre=article |
Archivos en el ítem
Archivos | Tamaño | Formato | Ver |
---|---|---|---|
No hay archivos asociados a este ítem. |