Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

Résumé

In contrast with conventional dynamic programming algorithms that return one solution, extensions of dynamic programming allows us to work with the whole set of solutions or its essential part, to perform multi-stage optimization relative to different criteria, to count the number of solutions, and to find the set of Pareto optimal points for bi-criteria optimization problems. The presentation is based on the results considered in three books published or accepted by Springer.
Fichier principal
Vignette du fichier
BookBackmatter.pdf (86.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03744111 , version 1 (02-08-2022)

Licence

Paternité

Identifiants

Citer

Mikhail Moshkov. Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. 4th International Conference on Intelligence Science (ICIS), Feb 2021, Durgapur, India. pp.313-317, ⟨10.1007/978-3-030-74826-5⟩. ⟨hal-03744111⟩
16 Consultations
28 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More