Polytechnique > Recherche > Répertoire > Un professeur ou chercheur

Répertoire des expertises

Photo de Gilles Savard

Gilles Savard

Professeur titulaire et directeur
Direction de la recherche et de l'innovation

Publications à Polytechnique

Ces données sont extraites du Répertoire des publications de l'École Polytechnique de Montréal. La liste ci-dessous contient seulement les publications auxquelles a participé le professeur ou le chercheur depuis son entrée en fonction à l’École. De plus, certaines publications ne sont pas dans cette liste, notamment les notes de cours et les rapports techniques internes plus d'information...

1Brotcorne, L., Cirinei, F., Marcotte, P., Savard, G. (2012). A Tabu Search Algorithm for the Network Pricing Problem. Computers & Operations Research, 39(11), p. 2603-2611. 
2Crevier, B., Cordeau, J.-F., Savard, G. (2012). Integrated Operations Planning and Revenue Management for Rail Freight Transportation. Transportation Research Part B-Methodological, 46(1), p. 100-119. 
3Heilporn, G., Labbe, M., Marcotte, P., Savard, G. (2011). Valid Inequalities and Branch-and-Cut for the Clique Pricing Problem. Discrete Optimization, 8(3), p. 393-410. 
4Audet C., Guillou A., Hansen P., Messine F. (2011). A New Multi-Objective Approach for the Portfolio Selection Problem With Skewness. Advances in Quantitative Analysis of Finance and Accounting. Taiwan: Airiti Press. p. 317-335.
5Audet, C., Savard, G., Zghal, W. (2010). A Mesh Adaptive Direct Search Algorithm for Multiobjective Optimization. European Journal of Operational Research, 204(3), p. 545-556. 
6Heilporn, G., Labbe, M., Marcotte, P., Savard, G. (2010). A Polyhedral Study of the Network Pricing Problem With Connected Toll Arcs. Networks, 55(3), p. 234-246. 
7Brotcorne, L., Cirinei, F., Marcotte, P., Savard, G. (2010). An Exact Algorithm for the Network Pricing Problem. Discrete Optimization. 
8Marcotte, P., Savard, G., Zhu, D. (2009). Mathematical Structure of a Bilevel Strategic Pricing Model. European Journal of Operational Research, 193(2), p. 552-566. 
9Marcotte, P., Mercier, A., Savard, G., Verter, V. (2009). Toll Policies for Mitigating Hazardous Materials Transport Risk. Transportation Science, 43(2), p. 228-243. 
10Brotcorne, L., Labbe, M., Marcotte, P., Savard, G. (2008). Joint Design and Pricing on a Network. Operations Research, 56(5), p. 1104-1115. 
11Bigras, L.P., Gamache, M., Savard, G. (2008). The Time-Dependent Traveling Salesman Problem and Single Machine Scheduling Problems With Sequence Dependent Setup Times. Discrete Optimization, 5(4), p. 685-699. 
12Audet, C., Savard, G., Zghal, W. (2008). Multiobjective Optimization Through a Series of Single-Objective Formulations. Siam Journal on Optimization, 19(1), p. 188-210. 
13Dewez, S., Labbe, M., Marcotte, P., Savard, G. (2008). New Formulations and Valid Inequalities for a Bilevel Pricing Problem. Operations Research Letters, 36(2), p. 141-149. 
14Bigras, L.P., Gamache, M., Savard, G. (2008). Time-Indexed Formulations and the Total Weighted Tardiness Problem. Informs Journal on Computing, 20(1), p. 133-142. 
15Audet, C., Savard, G., Zghal, W. (2007). New Branch-and-Cut Algorithm for Bilevel Linear Programming. Journal of Optimization Theory and Applications, 134(2), p. 353-370. 
16Colson, B., Marcotte, P., Savard, G. (2007). An Overview of Bilevel Optimization. Annals of Operations Research, 153(1), p. 235-256. 
17Audet, C., Haddad, J., Savard, G. (2007). Disjunctive Cuts for Continuous Linear Bilevel Programming. Optimization Letters, 1(3), p. 259-267. 
18Audet, C., Haddad, J., Savard, G. (2006). A Note on the Definition of a Linear Bilevel Programming Solution. Applied Mathematics and Computation, 181(1), p. 351-355. 
19Dussault, J.P., Marcotte, P., Roch, S., Savard, G. (2006). A Smoothing Heuristic for a Bilevel Pricing Problem. European Journal of Operational Research, 174(3), p. 1396-1413. 
20Piedras, H., Yacout, S., Savard, G. (2006). Concurrent Optimization of Customer Requirements and the Design of a New Product. International Journal of Production Research, 44(20), p. 4401-4416. 
21Guerin, J., Marcotte, P., Savard, G. (2006). An Optimal Adaptive Algorithm for the Approximation of Concave Functions. Mathematical Programming, 107(3), p. 357-366. 
22Roch, S., Savard, G., Marcotte, P. (2005). An Approximation Algorithm for Stackelberg Network Pricing. Networks, 46(1), p. 57-67. 
23Colson, B., Marcotte, P., Savard, G. (2005). A Trust-Region Method for Nonlinear Bilevel Programming: Algorithm and Computational Experience. Computational Optimization and Applications, 30(3), p. 211-227. 
24Marcotte P., Savard G. (2005). Bilevel Programming: A Combinatorial Perspective. Graph Theory and Combinatorial Optimization. p. 191-218.
25Brotcorne, L., Cirinei, F., Marcotte, P., Savard, G. (2004). A Local Serach Method for a Pricing Problem on a Transportation Network. TRISTAN V, 5th Triennial Symposium on Transportation Analysis.
26Fortin, M., Marcotte, P., Savard, G. (2004). Pricing a Segmented Market Subject to Congestion. TRISTAN V, 5th Triennial Symposium on Transportation Analysis.
27Marcotte, P., Savard, G., Semet, F. (2004). A Bilevel Programming Approach to the Travelling Salesman Problem. Operations Research Letters, 32(3), p. 240-248. 
28Langevin, A., Riopel, D., Savard, G., Bachmann, R. (2004). A Multi-Commodity Network Design Approach for Automated Guided Vehicle Systems. INFOR, 42(2), p. 113-123. 
29Alarie, S., Audet, C., Jaurnard, B., Savard, G. (2001). Concavity Cuts for Disjoint Bilinear Programming. Mathematical Programming, 90(2), p. 373-398. 
30Audet, C., Hansen, P., Jaumard, B., Savard, G. (2001). Enumeration of All Extreme Equilibria of Bimatrix Games. SIAM Journal on Scientific Computing, 23(1), p. 323-338. 
31Brotcorne, L., Labbe, M., Marcotte, P., Savard, G. (2001). A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network. Transportation Science, 35(4), p. 345-358. 
32Marcotte, P., Savard, G., Zhu, D.L. (2001). A Trust Region Algorithm for Nonlinear Bilevel Programming. Operations Research Letters, 29(4), p. 171-179. 
33Audet, C., Hansen, P., Jaumard, B., Savard, G. (2000). A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming. Mathematical Programming, 87(1), p. 131-152. 
34Brotcorne, L., Labbé, M., Marcotte, P., Savard, G. (2000). A Bilevel Model and Solution Algorithm for a Freight Tariff- Setting Problem. Transportation Science, 34(3), p. 289-302. 
35Lavigne, D., Loulou, R., Savard, G. (2000). Pure Competition, Regulated and Stackelberg Equilibria: Application to the Energy System of Quebec. European Journal of Operational Research, 125(1), p. 1-17. 
36Riopel, D., Langevin, A., Savard, G. (2000). Guidepath Design for an Automated Guided Vehicle System: Locating the Pick-Up and Delivery Stations. Journal of Engineering Valuation and Cost Analysis, 2(5), p. 387-394. 
37Audet, C., Hansen, P., Jaumard, B., Savard, G. (1999). A Symmetrical Linear Maxmin Approach to Disjoint Bilinear Programming. Mathematical Programming, 85(3), p. 573-592. 
38Berger, C., Savard, G., Wizere, A. (1999). Eugene: an Optimization Model for Integrated Regional Solid Waste Management Planning. International Journal of Environment and Pollution, 12(2-3), p. 280-307. 
39Audet, C., Hansen, P., Jaumard, B., Savard, G. (1998). Enumeration of All Extreme Equilibrum Strategies of Biomatrix Games. Eight International Symposium on Dynamic Games and Applications, p. 60-64. 
40Audet, C., Hansen, P., Jaumard, B., Savard, G. (1998). On the Linear Maxmin and Related Programming Problems. Multilevel Optimization: Algorithms and Applications, p. 181-208. 
41Berger, C., Chauny, F., Langevin, A., Loulou, R., Riopel, D., Savard, G., Waaub, J.-P. (1998). EUGENE: an Optimisation-Based Decision Support System for Long Term Integrated Regional Solid Waste Management Planning. International Workshop, Swedish Environmental Protection Agency, p. 11-29. 
42Labbé, M., Marcotte, P., Savard, G. (1998). A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing. Management Science, 44(12), p. 1608-1622. 
43Audet, C., Hansen, P., Jaumard, B., Savard, G. (1997). Links Between Linear Bilevel and Mixed 0-1 Programming Problems. Journal of Optimization Theory and Applications, 93(2), p. 273-300. 
44Riopel, D., Langevin, A., Savard, G. (1997). Flow Path Design for an Automated Guided Vehicle System. 1st International Conference on Engineering Design and Automation (ED&A'97), p. 445-446. 
45Vicente, L., Savard, G., Judice, J. (1996). Discrete Linear Bilevel Programming Problem. Journal of Optimization Theory and Applications, 89(3), p. 597-614. 
46Marcotte, P., Marquis, G., Savard, G. (1995). A New Implicit Enumeration Scheme for the Discriminant Analysis Problem. Computers & Operations Research, 22(6), p. 625-639. 
47Savard, G., Gauvin, J. (1994). Steepest Descent Direction for the Nonlinear Bilevel Programming Problem. Operations Research Letters, 15(5), p. 265-273. 

 

© École Polytechnique de Montréal
Bottin | Plan du site | Recherche | Conditions