 | Monter d'un niveau |
Alarie, S., Audet, C., Jaumard, B., & Savard, G. (2001). Concavity Cuts for Disjoint Bilinear Programming. Mathematical Programming, 90(2), 373-398. Lien externe
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (2001). Enumeration of All Extreme Equilibria of Bimatrix Games. SIAM Journal on Scientific Computing, 23(1), 323-338. Lien externe
Brotcorne, L., Labbe, M., Marcotte, P., & Savard, G. (2001). A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network. Transportation Science, 35(4), 345-358. Lien externe
Langevin, A., Riopel, D., Savard, G., & Bachmann, R. (2001). A multi-commodity network design approach for automated guided vehicle systems. (Rapport technique n° G-2001-36). Lien externe
Marcotte, P., & Savard, G. (2001). Bilevel Programming. Dans Encyclopedia of Optimization (155-156). Lien externe
Marcotte, P., & Savard, G. (2001). Bilevel Programming: Algorithms. Dans Encyclopedia of Optimization (156-158). Lien externe
Marcotte, P., & Savard, G. (2001). Bilevel programming: applications. Dans Encyclopedia of Optimization (158-160). Lien externe
Marcotte, P., Savard, G., & Zhu, D. L. (2001). A Trust Region Algorithm for Nonlinear Bilevel Programming. Operations Research Letters, 29(4), 171-179. Lien externe
