Linear Programming versus convex quadratic programming for the module allocation problem - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2005

Linear Programming versus convex quadratic programming for the module allocation problem

Fichier non déposé

Dates et versions

hal-01125237 , version 1 (06-03-2015)

Identifiants

  • HAL Id : hal-01125237 , version 1

Citer

Sourour Elloumi. Linear Programming versus convex quadratic programming for the module allocation problem. [Research Report] CEDRIC-05-1100, CEDRIC Lab/CNAM. 2005. ⟨hal-01125237⟩
11 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More