![]() | Monter d'un niveau |
Berger, 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), 280-307. Lien externe
Caporossi, G., Cvetković, D., Gutman, I., & Hansen, P. (1999). Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy. Journal of Chemical Information and Computer Sciences, 39(6), 984-996. Lien externe
Caporossi, G., Gutman, I., & Hansen, P. (1999). Variable neighborhood search for extremal graphs: IV: Chemical trees with extremal connectivity index. Computers & Chemistry, 23(5), 469-477. Lien externe
du Merle, O., Villeneuve, D. L., Desrosiers, J., & Hansen, P. (1999). Stabilized column generation. Discrete Mathematics, 194(1-3), 229-237. Lien externe
Gamache, M., Soumis, F., Marquis, G., & Desrosiers, J. (1999). A Column Generation Approach for Large-Scale Aircrew Rostering Problems. Operations Research, 47(2), 247-263. Lien externe
Gendreau, M., Larochelle, J.-F., & Sanso, B. (1999). A Tabu Search Heuristic for the Steiner Tree Problem. Networks, 34(2), 162-172. Lien externe
Gutman, I., Miljkovic, O., Caporossi, G., & Hansen, P. (1999). Alkanes with small and large Randić connectivity indices. Chemical Physics Letters, 306(5-6), 366-372. Lien externe
Hansen, P., Jaumard, B., & Nguetsé, G.-B. D. (1999). Best Second Order Bounds for Two-Terminal Network Reliability With Dependent Edge Failures. Discrete Applied Mathematics, 97, 375-393. Lien externe
Ioachim, I., Desrosiers, J., Soumis, F., & Bélanger, N. (1999). Fleet Assignment and Routing With Schedule Synchronization Constraints. European Journal of Operational Research, 119(1), 75-90. Lien externe
Kohl, N., Desrosiers, J., Madsen, O. B. G., Solomon, M. M., & Soumis, F. (1999). 2-Path Cuts for the Vehicle Routing Problem With Time Windows. Transportation Science, 33(1), 101-116. Lien externe
Ziarati, K., Soumis, F., Desrosiers, J., & Solomon, M. M. (1999). A Branch-First, Cut-Second Approach for Locomotive Assignment. Management Science, 45(8), 1156-1168. Lien externe
Alarie, S., Audet, C., Jaumard, B., & Savard, G. (1999). Concavity Cuts for Disjoint Bilinear Programming. (Rapport technique n° G-99-38). Lien externe
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1999). A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming. (Rapport technique n° G-97-67). Lien externe
Chamberland, S., & Sanso, B. (1999). Expansion of Multiple Ring MANs. (Rapport technique n° G-99-32). Lien externe
Chamberland, S., & Sanso, B. (1999). Update of Two-Level Networks with Modular Switches. (Rapport technique n° G-99-29). Lien externe
Chamberland, S., Sanso, B., & Marcotte, O. (1999). Topological Design of Two-Level Telecommunication Networks with Modular Switches. (Rapport technique n° G-97-29). Lien externe
Gendreau, M., Laporte, G., & Potvin, J.-Y. (1999). Metaheuristics for the Vehicle Routing Problem. (Rapport technique n° G-98-52). Lien externe
Laporte, G., Gendreau, M., Potvin, J.-Y., & Semet, F. (1999). Classical and Modern Heuristics for the Vehicle Routing Problem. (Rapport technique n° G-99-21). Lien externe
Malhamé, R. P., & Mbihi, J. (1999). Optimization of a Class of Decentralized Hedging Policies in a Stochastic Two-Machine Flow Shop. (Rapport technique n° G-99-19). Lien externe
Nagih, A., & Soumis, F. (1999). L'agrégation des contraintes de ressources dans un problème de plus court chemin. (Rapport technique n° G-99-02). Lien externe
Soriano, P., Wynants, C., Séguin, R., Labbé, M., Gendreau, M., & Fortz, B. (1999). Design and Dimensioning of Survivable SDH/Sonet Networks. Dans Telecommunications Network Planning (p. 147-167). Lien externe