CLAUTIAUX, François; DETIENNE, Boris; GUILLOT, Gaël

doi:10.1016/j.ejor.2020.12.036

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

CLAUTIAUX, François
Reformulations based algorithms for Combinatorial Optimization [Realopt]

DETIENNE, Boris
Reformulations based algorithms for Combinatorial Optimization [Realopt]

GUILLOT, Gaël
Reformulations based algorithms for Combinatorial Optimization [Realopt]

Langue

Article de revue

Ce document a été publié dans

European Journal of Operational Research. 2021-09-01, vol. 293, n° 2

Elsevier

Résumé en anglais

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.< Réduire

Mots clés en anglais

Temporal knapsack

Exact algorithm

Lagrangian Relaxation

Successive Sublimation Dynamic Programming method

Métadonnées

Partager cette publication !

Licence d’utilisation du document

An iterative dynamic programming approach for the temporal knapsack problem

Langue

Ce document a été publié dans

Résumé en anglais

Mots clés en anglais

URI

DOI

Origine

Unités de recherche