NP-Hard sub-problems involving costs, Lagrangian based filtering - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

NP-Hard sub-problems involving costs, Lagrangian based filtering

Fichier non déposé

Dates et versions

hal-02136620 , version 1 (22-05-2019)

Identifiants

  • HAL Id : hal-02136620 , version 1

Citer

Hadrien Cambazard. NP-Hard sub-problems involving costs, Lagrangian based filtering. ACP Summer school, Jun 2014, Bologna, Italy. ⟨hal-02136620⟩
10 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More