Managing Time Expanded Networks: The Strong Lift Problem - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2024

Managing Time Expanded Networks: The Strong Lift Problem

Gestion des réseaux étendus dans le temps : le problème du remontage fort

Résumé

Time Expanded Networks, built by considering the vertices of a base network all over some time space, are powerful tools for the formulation of problems that simultaneously involve resource assignment and scheduling. Still, inmost cases, deriving algorithms from those formulations is difficult.We implement here a generic Project and Lift decomposition scheme while solving the Strong Lift issue, which consists in turning a solution defined on the base network into a solution of the whole problem with identical cost.
Fichier non déposé

Dates et versions

hal-04280455 , version 1 (11-11-2023)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

José-L. Figueroa, Alain Quilliot, Hélène Toussaint, Annegret Wagler. Managing Time Expanded Networks: The Strong Lift Problem. Graphs and Combinatorial Optimization: from Theory to Applications, 13, Springer; Springer Nature Switzerland, pp.53-65, 2024, AIRO Springer Series, 978-3-031-46825-4. ⟨10.1007/978-3-031-46826-1_5⟩. ⟨hal-04280455⟩
48 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More