Charles Audet
, Pierre Hansen, Brigitte Jaumard and Gilles Savard
Technical Report (1999)
An external link is available for this item| Department: | Department of Mathematics and Industrial Engineering |
|---|---|
| Research Center: | GERAD - Research Group in Decision Analysis |
| PolyPublie URL: | https://publications.polymtl.ca/63495/ |
| Report number: | G-97-67 |
| Official URL: | https://www.gerad.ca/fr/papers/G-97-67 |
| Date Deposited: | 25 Mar 2025 14:19 |
| Last Modified: | 25 Mar 2025 14:19 |
| Cite in APA 7: | Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1999). A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming. (Technical Report n° G-97-67). https://www.gerad.ca/fr/papers/G-97-67 |
|---|---|
Statistics
Stats are not available on this system.
Repository Staff Only
|
View Item |
