| Year |
Citation |
Score |
| 2020 |
Desaulniers G, Gschwind T, Irnich S. Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models Transportation Science. 54: 1170-1188. DOI: 10.1287/Trsc.2020.0988 |
0.517 |
|
| 2020 |
Dalmeijer K, Desaulniers G. Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem Informs Journal On Computing. DOI: 10.1287/Ijoc.2020.0974 |
0.528 |
|
| 2020 |
Er-Rbib S, Desaulniers G, Hallaoui IE, Bani A. Integrated and sequential solution methods for the cyclic bus driver rostering problem Journal of the Operational Research Society. 1-16. DOI: 10.1080/01605682.2019.1700187 |
0.435 |
|
| 2020 |
Bretin A, Desaulniers G, Rousseau L. The traveling salesman problem with time windows in postal services Journal of the Operational Research Society. 1-15. DOI: 10.1080/01605682.2019.1678403 |
0.4 |
|
| 2020 |
Rodríguez JA, Anjos MF, Côté P, Desaulniers G. Accelerating Benders decomposition for short-term hydropower maintenance scheduling European Journal of Operational Research. DOI: 10.1016/J.Ejor.2020.06.041 |
0.587 |
|
| 2020 |
Quesnel F, Desaulniers G, Soumis F. A branch-and-price heuristic for the crew pairing problem with language constraints European Journal of Operational Research. 283: 1040-1054. DOI: 10.1016/J.Ejor.2019.11.043 |
0.46 |
|
| 2020 |
Dahmen S, Rekik M, Soumis F, Desaulniers G. A two-stage solution approach for personalized multi-department multi-day shift scheduling European Journal of Operational Research. 280: 1051-1063. DOI: 10.1016/J.Ejor.2019.07.068 |
0.474 |
|
| 2020 |
Hassani R, Desaulniers G, Elhallaoui I. Real-time personnel re-scheduling after a minor disruption in the retail industry Computers & Operations Research. 120: 104952. DOI: 10.1016/J.Cor.2020.104952 |
0.572 |
|
| 2020 |
Löffler M, Desaulniers G, Irnich S, Schneider M. Routing electric vehicles with a single recharge per route Networks. 76: 187-205. DOI: 10.1002/Net.21964 |
0.336 |
|
| 2019 |
Quesnel F, Desaulniers G, Soumis F. Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem Transportation Science. 54: 97-114. DOI: 10.1287/Trsc.2019.0913 |
0.436 |
|
| 2019 |
Costa L, Contardo C, Desaulniers G. Exact Branch-Price-and-Cut Algorithms for Vehicle Routing Transportation Science. 53: 946-985. DOI: 10.1287/Trsc.2018.0878 |
0.556 |
|
| 2019 |
Dayarian I, Desaulniers G. A Branch-Price-and-Cut Algorithm for a Production-Routing Problem with Short-Life-Span Products Transportation Science. 53: 829-849. DOI: 10.1287/Trsc.2018.0854 |
0.439 |
|
| 2019 |
Bürgy R, Michon-Lacaze H, Desaulniers G. Employee scheduling with short demand perturbations and extensible shifts Omega-International Journal of Management Science. 89: 177-192. DOI: 10.1016/J.Omega.2018.10.009 |
0.531 |
|
| 2019 |
Fink M, Desaulniers G, Frey MM, Kiermaier F, Kolisch R, Soumis F. Column generation for vehicle routing problems with multiple synchronization constraints European Journal of Operational Research. 272: 699-711. DOI: 10.1016/J.Ejor.2018.06.046 |
0.546 |
|
| 2019 |
Tahir A, Desaulniers G, Hallaoui IE. Integral column generation for the set partitioning problem Euro Journal On Transportation and Logistics. 8: 713-744. DOI: 10.1007/S13676-019-00145-6 |
0.623 |
|
| 2019 |
Bagger NF, Desaulniers G, Desrosiers J. Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem Journal of Scheduling. 22: 155-172. DOI: 10.1007/S10951-018-0582-0 |
0.485 |
|
| 2018 |
Rodriguez JA, Anjos MF, Cote P, Desaulniers G. MILP Formulations for Generator Maintenance Scheduling in Hydropower Systems Ieee Transactions On Power Systems. 33: 6171-6180. DOI: 10.1109/Tpwrs.2018.2833061 |
0.544 |
|
| 2018 |
Desfontaines L, Desaulniers G. Multiple depot vehicle scheduling with controlled trip shifting Transportation Research Part B-Methodological. 113: 34-53. DOI: 10.1016/J.Trb.2018.05.011 |
0.585 |
|
| 2018 |
Maher SJ, Desaulniers G, Soumis F. The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints European Journal of Operational Research. 264: 534-547. DOI: 10.1016/J.Ejor.2017.06.041 |
0.578 |
|
| 2017 |
Lehouillier T, Nasri MI, Soumis F, Desaulniers G, Omer J. Solving the Air Conflict Resolution Problem Under Uncertainty Using an Iterative Biobjective Mixed Integer Programming Approach Transportation Science. 51: 1242-1258. DOI: 10.1287/Trsc.2016.0714 |
0.521 |
|
| 2017 |
Pecin D, Contardo C, Desaulniers G, Uchoa E. New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows Informs Journal On Computing. 29: 489-502. DOI: 10.1287/Ijoc.2016.0744 |
0.573 |
|
| 2017 |
Bouarab H, Desaulniers G, Desrosiers J, Gauthier JB. Linear fractional approximations for master problems in column generation Operations Research Letters. 45: 503-507. DOI: 10.1016/J.Orl.2017.08.004 |
0.521 |
|
| 2017 |
Quesnel F, Desaulniers G, Soumis F. A new heuristic branching scheme for the crew pairing problem with base constraints Computers & Operations Research. 80: 159-172. DOI: 10.1016/J.Cor.2016.11.020 |
0.576 |
|
| 2017 |
Veenstra M, Cherkesly M, Desaulniers G, Laporte G. The pickup and delivery problem with time windows and handling operations Computers and Operations Research. 77: 127-140. DOI: 10.1016/J.Cor.2016.07.014 |
0.518 |
|
| 2017 |
Desaulniers G, Pecin D, Contardo C. Selective pricing in branch-price-and-cut algorithms for vehicle routing Euro Journal On Transportation and Logistics. 8: 147-168. DOI: 10.1007/S13676-017-0112-9 |
0.537 |
|
| 2017 |
Archetti C, Desaulniers G, Speranza MG. Minimizing the logistic ratio in the inventory routing problem Euro Journal On Transportation and Logistics. 6: 289-306. DOI: 10.1007/S13676-016-0097-9 |
0.53 |
|
| 2016 |
Desaulniers G, Rakke JG, Coelho LC. A branch-price-and-cut algorithm for the inventory-routing problem Transportation Science. 50: 1060-1076. DOI: 10.1287/Trsc.2015.0635 |
0.595 |
|
| 2016 |
Desaulniers G, Errico F, Irnich S, Schneider M. Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows Operations Research. 64: 1388-1405. DOI: 10.1287/Opre.2016.1535 |
0.547 |
|
| 2016 |
Andersson H, Christiansen M, Desaulniers G. A new decomposition algorithm for a liquefied natural gas inventory routing problem International Journal of Production Research. 54: 564-578. DOI: 10.1080/00207543.2015.1037024 |
0.61 |
|
| 2016 |
Errico F, Desaulniers G, Gendreau M, Rei W, Rousseau LM. A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times European Journal of Operational Research. 249: 55-66. DOI: 10.1016/J.Ejor.2015.07.027 |
0.578 |
|
| 2016 |
Errico F, Desaulniers G, Gendreau M, Rei W, Rousseau L. The vehicle routing problem with hard time windows and stochastic service times Euro Journal On Transportation and Logistics. 7: 223-251. DOI: 10.1007/S13676-016-0101-4 |
0.58 |
|
| 2015 |
Cherkesly M, Desaulniers G, Laporte G. Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading Transportation Science. 49: 752-766. DOI: 10.1287/Trsc.2014.0535 |
0.594 |
|
| 2015 |
Rakke JG, Andersson H, Christiansen M, Desaulniers G. A new formulation based on customer delivery patterns for a maritime inventory routing problem Transportation Science. 49: 384-401. DOI: 10.1287/Trsc.2013.0503 |
0.544 |
|
| 2015 |
De La Poix De Fréminville P, Desaulniers G, Rousseau LM, Perron S. A column generation heuristic for districting the price of a financial product Journal of the Operational Research Society. 66: 965-978. DOI: 10.1057/Jors.2014.64 |
0.479 |
|
| 2015 |
Karsten CV, Brouer BD, Desaulniers G, Pisinger D. Time constrained liner shipping network design Transportation Research Part E: Logistics and Transportation Review. DOI: 10.1016/J.Tre.2016.03.010 |
0.48 |
|
| 2015 |
Lehouillier T, Omer J, Soumis F, Desaulniers G. Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem European Journal of Operational Research. DOI: 10.1016/J.Ejor.2016.07.008 |
0.577 |
|
| 2015 |
Cherkesly M, Desaulniers G, Irnich S, Laporte G. Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks European Journal of Operational Research. DOI: 10.1016/J.Ejor.2015.10.046 |
0.599 |
|
| 2015 |
Spliet R, Desaulniers G. The discrete time window assignment vehicle routing problem European Journal of Operational Research. 244: 379-391. DOI: 10.1016/J.Ejor.2015.01.020 |
0.622 |
|
| 2015 |
Cherkesly M, Desaulniers G, Laporte G. A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading Computers and Operations Research. 62: 23-35. DOI: 10.1016/J.Cor.2015.04.002 |
0.524 |
|
| 2015 |
Andersson H, Christiansen M, Desaulniers G, Rakke JG. Creating annual delivery programs of liquefied natural gas Optimization and Engineering. 1-18. DOI: 10.1007/S11081-015-9305-Y |
0.49 |
|
| 2015 |
Brouer BD, Desaulniers G, Karsten CV, Pisinger D. A matheuristic for the liner shipping network design problem with transit time restrictions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9335: 195-208. DOI: 10.1007/978-3-319-24264-4_14 |
0.346 |
|
| 2015 |
Lehouillier T, Omer J, Soumis F, Desaulniers G. A new variant of the minimum-weight maximum-cardinality clique problem to solve conflicts between aircraft Advances in Intelligent Systems and Computing. 359: 3-14. DOI: 10.1007/978-3-319-18161-5_1 |
0.397 |
|
| 2015 |
Contardo C, Desaulniers G, Lessard F. Reaching the elementary lower bound in the vehicle routing problem with time windows Networks. 65: 88-99. DOI: 10.1002/Net.21594 |
0.639 |
|
| 2015 |
Lehouillier T, Omer J, Soumis F, Desaulniers G. A flexible framework for solving the air conflict detection and resolution problem using maximum cliques in a graph Proceedings of the 11th Usa/Europe Air Traffic Management Research and Development Seminar, Atm 2015. |
0.478 |
|
| 2014 |
Groiez M, Desaulniers G, Marcotte O. Valid inequalities and separation algorithms for the set partitioning problem Infor. 52: 185-196. DOI: 10.3138/Infor.52.4.185 |
0.699 |
|
| 2014 |
Brouer BD, Desaulniers G, Pisinger D. A matheuristic for the liner shipping network design problem Transportation Research Part E: Logistics and Transportation Review. 72: 42-59. DOI: 10.1016/J.Tre.2014.09.012 |
0.535 |
|
| 2014 |
Gauvin C, Desaulniers G, Gendreau M. A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands Computers and Operations Research. 50: 141-153. DOI: 10.1016/J.Cor.2014.03.028 |
0.632 |
|
| 2014 |
Maher SJ, Desaulniers G, Soumis F. Recoverable robust single day aircraft maintenance routing problem Computers and Operations Research. 51: 130-145. DOI: 10.1016/J.Cor.2014.03.007 |
0.478 |
|
| 2014 |
Ialongo DL, Desaulniers G. Airline fleet assignment with internal passenger flow reevaluations Euro Journal On Transportation and Logistics. 3: 121-142. DOI: 10.1007/S13676-013-0038-9 |
0.546 |
|
| 2014 |
Ribeiro GM, Desaulniers G, Desrosiers J, Vidal T, Vieira BS. Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon Journal of Heuristics. 20: 677-708. DOI: 10.1007/S10732-014-9262-1 |
0.527 |
|
| 2014 |
Prescott-Gagnon E, Desaulniers G, Rousseau LM. Heuristics for an oil delivery vehicle routing problem Flexible Services and Manufacturing Journal. 26: 516-539. DOI: 10.1007/S10696-012-9169-9 |
0.794 |
|
| 2014 |
Benavent E, Corberán A, Desaulniers G, Lessard F, Plana I, Sanchis JM. A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem Networks. 63: 34-45. DOI: 10.1002/Net.21520 |
0.612 |
|
| 2013 |
Lequy Q, Desaulniers G, Solomon MM. Assigning team tasks and multiple activities to fixed work shifts Infor. 51: 64-75. DOI: 10.3138/Infor.51.2.64 |
0.473 |
|
| 2013 |
Saddoune M, Desaulniers G, Soumis F. Aircrew pairings with possible repetitions of the same flight number Computers and Operations Research. 40: 805-814. DOI: 10.1016/J.Cor.2010.11.003 |
0.568 |
|
| 2013 |
Elahipanah M, Desaulniers G, Lacasse-Guay E. A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts Journal of Scheduling. 16: 443-460. DOI: 10.1007/S10951-013-0324-2 |
0.716 |
|
| 2012 |
Saddoune M, Desaulniers G, Elhallaoui I, Soumis F. Integrated airline crew pairing and crew assignment by dynamic constraint aggregation Transportation Science. 46: 39-55. DOI: 10.1287/Trsc.1110.0379 |
0.56 |
|
| 2012 |
Benchimol P, Desaulniers G, Desrosiers J. Stabilized dynamic constraint aggregation for solving set partitioning problems European Journal of Operational Research. 223: 360-371. DOI: 10.1016/J.Ejor.2012.07.004 |
0.549 |
|
| 2012 |
Stålhane M, Andersson H, Christiansen M, Cordeau JF, Desaulniers G. A branch-price-and-cut method for a ship routing and scheduling problem with split loads Computers and Operations Research. 39: 3361-3375. DOI: 10.1016/J.Cor.2012.04.021 |
0.593 |
|
| 2012 |
Mattos Ribeiro G, Desaulniers G, Desrosiers J. A branch-price-and-cut algorithm for the workover rig routing problem Computers and Operations Research. 39: 3305-3315. DOI: 10.1016/J.Cor.2012.04.010 |
0.554 |
|
| 2012 |
Lequy Q, Desaulniers G, Solomon MM. A two-stage heuristic for multi-activity and task assignment to work shifts Computers and Industrial Engineering. 63: 831-841. DOI: 10.1016/J.Cie.2012.05.005 |
0.509 |
|
| 2012 |
Lequy Q, Bouchard M, Desaulniers G, Soumis F, Tachefine B. Assigning multiple activities to work shifts Journal of Scheduling. 15: 239-251. DOI: 10.1007/S10951-010-0179-8 |
0.477 |
|
| 2011 |
Archetti C, Bouchard M, Desaulniers G. Enhanced branch and price and cut for vehicle routing with split deliveries and time windows Transportation Science. 45: 285-298. DOI: 10.1287/Trsc.1100.0363 |
0.604 |
|
| 2011 |
Elhallaoui I, Metrane A, Desaulniers G, Soumis F. An improved primal simplex algorithm for degenerate linear programs Informs Journal On Computing. 23: 569-577. DOI: 10.1287/Ijoc.1100.0425 |
0.439 |
|
| 2011 |
Saddoune M, Desaulniers G, Elhallaoui I, Soumis F. Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods European Journal of Operational Research. 212: 445-454. DOI: 10.1016/J.Ejor.2011.02.009 |
0.547 |
|
| 2011 |
Desaulniers G, Desrosiers J, Spoorendonk S. Cutting planes for branch-and-price algorithms Networks. 58: 301-310. DOI: 10.1002/Net.20471 |
0.521 |
|
| 2010 |
Spoorendonk S, Desaulniers G. Clique inequalities applied to the vehicle routing problem with time windows Infor. 48: 53-67. DOI: 10.3138/Infor.48.1.053 |
0.616 |
|
| 2010 |
Prescott-Gagnon E, Desaulniers G, Drexl M, Rousseau LM. European driver rules in vehicle routing with time windows Transportation Science. 44: 455-473. DOI: 10.1287/Trsc.1100.0328 |
0.794 |
|
| 2010 |
Potthoff D, Huisman D, Desaulniers G. Column generation with dynamic duty selection for railway crew rescheduling Transportation Science. 44: 493-505. DOI: 10.1287/Trsc.1100.0322 |
0.579 |
|
| 2010 |
Grønhaug R, Christiansen M, Desaulniers G, Desrosiers J. A branch-and-price method for a liquefied natural gas inventory routing problem Transportation Science. 44: 400-415. DOI: 10.1287/Trsc.1100.0317 |
0.526 |
|
| 2010 |
Desaulniers G. Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows Operations Research. 58: 179-192. DOI: 10.1287/Opre.1090.0713 |
0.621 |
|
| 2010 |
Irnich S, Desaulniers G, Desrosiers J, Hadjar A. Path-reduced costs for eliminating arcs in routing and scheduling Informs Journal On Computing. 22: 297-313. DOI: 10.1287/Ijoc.1090.0341 |
0.572 |
|
| 2010 |
Boubaker K, Desaulniers G, Elhallaoui I. Bidline scheduling with equity by heuristic dynamic constraint aggregation Transportation Research Part B: Methodological. 44: 50-61. DOI: 10.1016/J.Trb.2009.06.003 |
0.584 |
|
| 2010 |
Lacasse-Guay E, Desaulniers G, Soumis F. Aircraft routing under different business processes Journal of Air Transport Management. 16: 258-263. DOI: 10.1016/J.Jairtraman.2010.02.001 |
0.572 |
|
| 2010 |
Gutiérrez-Jarpa G, Desaulniers G, Laporte G, Marianov V. A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows European Journal of Operational Research. 206: 341-349. DOI: 10.1016/J.Ejor.2010.02.037 |
0.585 |
|
| 2010 |
Elhallaoui I, Metrane A, Soumis F, Desaulniers G. Multi-phase dynamic constraint aggregation for set partitioning type problems Mathematical Programming. 123: 345-370. DOI: 10.1007/S10107-008-0254-5 |
0.538 |
|
| 2009 |
Pepin AS, Desaulniers G, Hertz A, Huisman D. A comparison of five heuristics for the multiple depot vehicle scheduling problem Journal of Scheduling. 12: 17-30. DOI: 10.1007/S10951-008-0072-X |
0.638 |
|
| 2009 |
Bouchard M, Hertz A, Desaulniers G. Lower bounds and a tabu search algorithm for the minimum deficiency problem Journal of Combinatorial Optimization. 17: 168-191. DOI: 10.1007/S10878-007-9106-0 |
0.335 |
|
| 2009 |
Prescott-Gagnon E, Desaulniers G, Rousseau LM. A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows Networks. 54: 190-204. DOI: 10.1002/Net.V54:4 |
0.793 |
|
| 2009 |
Saddoune M, Desaulniers G, Soumis F. A rolling horizon solution approach for the airline crew pairing problem 2009 International Conference On Computers and Industrial Engineering, Cie 2009. 344-347. |
0.508 |
|
| 2008 |
Desaulniers G, Lessard F, Hadjar A. Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows Transportation Science. 42: 387-404. DOI: 10.1287/Trsc.1070.0223 |
0.646 |
|
| 2008 |
Elhallaoui I, Desaulniers G, Metrane A, Soumis F. Bi-dynamic constraint aggregation and subproblem reduction Computers and Operations Research. 35: 1713-1724. DOI: 10.1016/J.Cor.2006.10.007 |
0.466 |
|
| 2007 |
Achour H, Gamache M, Soumis F, Desaulniers G. An exact solution approach for the preferential biddine system problem in the airline industry Transportation Science. 41: 354-365. DOI: 10.1287/Trsc.1060.0172 |
0.519 |
|
| 2007 |
Hamdouni M, Soumis F, Desaulniers G. Parking buses in a depot with stochastic arrival times European Journal of Operational Research. 183: 502-515. DOI: 10.1016/J.Ejor.2006.10.004 |
0.525 |
|
| 2007 |
Hamdouni M, Desaulniers G, Soumis F. Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches Computers and Operations Research. 34: 3362-3379. DOI: 10.1016/J.Cor.2006.02.002 |
0.494 |
|
| 2007 |
Desaulniers G. Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation Computers and Operations Research. 34: 1221-1239. DOI: 10.1016/J.Cor.2005.07.002 |
0.517 |
|
| 2006 |
Hamdouni M, Desaulniers G, Marcotte O, Soumis F, Van Putten M. Dispatching buses in a depot using block patterns Transportation Science. 40: 364-377. DOI: 10.1287/Trsc.1050.0139 |
0.499 |
|
| 2006 |
Rouillon S, Desaulniers G, Soumis F. An extended branch-and-bound method for locomotive assignment Transportation Research Part B: Methodological. 40: 404-423. DOI: 10.1016/J.Trb.2005.05.005 |
0.516 |
|
| 2006 |
Bélanger N, Desaulniers G, Soumis F, Desrosiers J, Lavigne J. Weekly airline fleet assignment with homogeneity Transportation Research Part B: Methodological. 40: 306-318. DOI: 10.1016/J.Trb.2005.03.004 |
0.563 |
|
| 2006 |
Bélanger N, Desaulniers G, Soumis F, Desrosiers J. Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues European Journal of Operational Research. 175: 1754-1766. DOI: 10.1016/J.Ejor.2004.04.051 |
0.552 |
|
| 2005 |
Elhallaoui I, Villeneuve D, Soumis F, Desaulniers G. Dynamic aggregation of set-partitioning constraints in column generation Operations Research. 53: 632-645. DOI: 10.1287/Opre.1050.0222 |
0.589 |
|
| 2005 |
Villeneuve D, Desaulniers G. The shortest path problem with forbidden paths European Journal of Operational Research. 165: 97-107. DOI: 10.1016/J.Ejor.2004.01.032 |
0.558 |
|
| 2005 |
Irnich S, Desaulniers G. Shortest path problems with resource constraints Column Generation. 33-65. DOI: 10.1007/0-387-25486-2_2 |
0.458 |
|
| 2004 |
Paquet M, Martel A, Desaulniers G. Including technology selection decisions in manufacturing network design models International Journal of Computer Integrated Manufacturing. 17: 117-125. DOI: 10.1080/09511920310001593100 |
0.367 |
|
| 2003 |
Desaulniers G, Langevin A, Riopel D, Villeneuve B. Dispatching and conflict-free routing of automated guided vehicles: An exact approach International Journal of Flexible Manufacturing Systems. 15. DOI: 10.1023/B:Flex.0000036032.41757.3D |
0.586 |
|
| 2002 |
Lingaya N, Cordeau JF, Desaulniers G, Desrosiers J, Soumis F. Operational car assignment at VIA Rail Canada Transportation Research Part B: Methodological. 36: 755-778. DOI: 10.1016/S0191-2615(01)00027-3 |
0.571 |
|
| 2001 |
Haase K, Desaulniers G, Desrosiers J. Simultaneous vehicle and crew scheduling in urban mass transit systems Transportation Science. 35: 286-303. DOI: 10.1287/Trsc.35.3.286.10153 |
0.552 |
|
| 2001 |
Cordeau JF, Desaulniers G, Lingaya N, Soumis F, Desrosiers J. Simultaneous locomotive and car assignment at VIA Rail Canada Transportation Research Part B: Methodological. 35: 767-787. DOI: 10.1016/S0191-2615(00)00022-9 |
0.534 |
|
| 2000 |
Desaulniers G, Villeneuve D. The Shortest Path Problem with Time Windows and Linear Waiting Costs Transportation Science. 34: 312-319. DOI: 10.1287/Trsc.34.3.312.12298 |
0.515 |
|
| 2000 |
Desaulniers G, Villeneuve D. Shortest path problem with time windows and linear waiting costs Transportation Science. 34: 312-319. |
0.422 |
|
| 1999 |
Desaulniers G, Desrosiers J, Lasry A, Solomon MM. Crew pairing for a regional carrier Lecture Notes in Economics and Mathematical Systems. 19-41. DOI: 10.1007/978-3-642-85970-0_2 |
0.52 |
|
| 1998 |
Desaulniers G, Soumis F, Laurent JC. A shortest path algorithm for a carlike robot in a polygonal environment International Journal of Robotics Research. 17: 512-530. DOI: 10.1177/027836499801700504 |
0.441 |
|
| 1998 |
Desaulniers G, Lavigne J, Soumis F. Multi-depot vehicle scheduling problems with time windows and waiting costs European Journal of Operational Research. 111: 479-494. DOI: 10.1016/S0377-2217(97)00363-9 |
0.583 |
|
| 1997 |
Desaulniers G, Desrosiers J, Dumas Y, Solomon MM, Soumis F. Daily aircraft routing and scheduling Management Science. 43: 841-855. DOI: 10.1287/Mnsc.43.6.841 |
0.591 |
|
| 1997 |
Desaulniers G, Desrosiers J, Dumas Y, Marc S, Rioux B, Solomon MM, Soumis F. Crew pairing at Air France European Journal of Operational Research. 97: 245-259. DOI: 10.1016/S0377-2217(96)00195-6 |
0.588 |
|
| 1996 |
Desaulniers G. On shortest paths for a car-like robot maneuvering around obstacles Robotics and Autonomous Systems. 17: 139-148. DOI: 10.1016/0921-8890(96)80512-4 |
0.363 |
|
| 1995 |
Desaulniers G, Soumis F. An Efficient Algorithm to Find a Shortest Path for a Car-Like Robot Ieee Transactions On Robotics and Automation. 11: 819-828. DOI: 10.1109/70.478429 |
0.305 |
|
| Show low-probability matches. |