Charles Audet
, Gilles Savard and Walid Zghal
Technical Report (2004)
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/63483/ |
| Report number: | G-2004-13 |
| Official URL: | https://www.gerad.ca/fr/papers/G-2004-13 |
| Date Deposited: | 25 Mar 2025 14:19 |
| Last Modified: | 25 Mar 2025 14:19 |
| Cite in APA 7: | Audet, C., Savard, G., & Zghal, W. (2004). New Branch-and-Cut Algorithm for Bilevel Linear Programming. (Technical Report n° G-2004-13). https://www.gerad.ca/fr/papers/G-2004-13 |
|---|---|
Statistics
Stats are not available on this system.
Repository Staff Only
|
View Item |
