Linear Programming versus convex quadratic programming for the module allocation problem - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2005

Linear Programming versus convex quadratic programming for the module allocation problem

Not file

Dates and versions

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

Identifiers

  • HAL Id : hal-01125237 , version 1

Cite

Sourour Elloumi. Linear Programming versus convex quadratic programming for the module allocation problem. [Research Report] CEDRIC-05-1100, CEDRIC Lab/CNAM. 2005. ⟨hal-01125237⟩
6 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More