Year |
Citation |
Score |
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.472 |
|
2018 |
Gauthier JB, Desrosiers J, Lübbecke ME. Vector Space Decomposition for Solving Large-Scale Linear Programs Operations Research. 66: 1376-1389. DOI: 10.1287/Opre.2018.1728 |
0.438 |
|
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.52 |
|
2017 |
Gauthier JB, Desrosiers J, Lbbecke ME. A strongly polynomial Contraction-Expansion algorithm for network flow problems Computers & Operations Research. 84: 16-32. DOI: 10.1016/J.Cor.2017.02.019 |
0.402 |
|
2016 |
Gauthier JB, Desrosiers J, Lübbecke ME. Tools for primal degenerate linear programs: IPS, DCA, and PE Euro Journal On Transportation and Logistics. 5: 161-204. DOI: 10.1007/S13676-015-0077-5 |
0.485 |
|
2014 |
Gauthier JB, Desrosiers J, Lübbecke ME. Decomposition theorems for linear programs Operations Research Letters. 42: 553-557. DOI: 10.1016/J.Orl.2014.10.001 |
0.353 |
|
2014 |
Desrosiers J, Gauthier JB, Lübbecke ME. Row-reduced column generation for degenerate master problems European Journal of Operational Research. 236: 453-460. DOI: 10.1016/J.Ejor.2013.12.016 |
0.54 |
|
2014 |
Towhidi M, Desrosiers J, Soumis F. The positive edge criterion within COIN-OR Computers and Operations Research. 49: 41-46. DOI: 10.1016/J.Cor.2014.03.020 |
0.429 |
|
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.447 |
|
2013 |
Gauthier JB, Desrosiers J, Lübbecke ME. About the minimum mean cycle-canceling algorithm Discrete Applied Mathematics. DOI: 10.1016/J.Dam.2014.07.005 |
0.37 |
|
2013 |
Jans R, Desrosiers J. Efficient symmetry breaking formulations for the job grouping problem Computers and Operations Research. 40: 1132-1142. DOI: 10.1016/J.Cor.2012.11.017 |
0.482 |
|
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.523 |
|
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.461 |
|
2011 |
Rasekh L, Desrosiers J. A two-level interior-point decomposition algorithm for multi-stage stochastic capacity planning and technology acquisition International Journal of Mathematics in Operational Research. 3: 280-294. DOI: 10.1504/Ijmor.2011.040027 |
0.416 |
|
2011 |
Desaulniers G, Desrosiers J, Spoorendonk S. Cutting planes for branch-and-price algorithms Networks. 58: 301-310. DOI: 10.1002/Net.20471 |
0.512 |
|
2010 |
Rasekh L, Desrosiers J. Solving multi-stage stochastic in-house production and outsourcing planning by two-level decomposition International Journal of Mathematics in Operational Research. 2: 129-150. DOI: 10.1504/Ijmor.2010.030814 |
0.401 |
|
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.498 |
|
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.49 |
|
2010 |
Oppen J, Løkketangen A, Desrosiers J. Solving a rich vehicle routing and inventory problem using column generation Computers and Operations Research. 37: 1308-1317. DOI: 10.1016/J.Cor.2009.09.014 |
0.546 |
|
2009 |
Ben Amor HMT, Desrosiers J, Frangioni A. On the choice of explicit stabilizing terms in column generation Discrete Applied Mathematics. 157: 1167-1184. DOI: 10.1016/J.Dam.2008.06.021 |
0.707 |
|
2007 |
Bianchessi N, Cordeau JF, Desrosiers J, Laporte G, Raymond V. A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites European Journal of Operational Research. 177: 750-762. DOI: 10.1016/J.Ejor.2005.12.026 |
0.379 |
|
2007 |
Oukil A, Amor HB, Desrosiers J, El Gueddari H. Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems Computers and Operations Research. 34: 817-834. DOI: 10.1016/J.Cor.2005.05.011 |
0.51 |
|
2006 |
Ben Amor H, Desrosiers J, Valério De Carvalho JM. Dual-optimal inequalities for stabilized column generation Operations Research. 54: 454-463. DOI: 10.1287/Opre.1060.0278 |
0.73 |
|
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.532 |
|
2006 |
Amor HB, Desrosiers J, Soumis F. Recovering an optimal LP basis from an optimal dual solution Operations Research Letters. 34: 569-576. DOI: 10.1016/J.Orl.2005.10.001 |
0.455 |
|
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.483 |
|
2006 |
Ben Amor H, Desrosiers J. A proximal trust-region algorithm for column generation stabilization Computers and Operations Research. 33: 910-927. DOI: 10.1016/J.Cor.2004.08.003 |
0.681 |
|
2005 |
Lübbecke ME, Desrosiers J. Selected topics in column generation Operations Research. 53: 1007-1023. DOI: 10.1287/Opre.1050.0234 |
0.42 |
|
2005 |
Hicks R, Madrid R, Milligan C, Pruneau R, Kanaley M, Dumas Y, Lacroix B, Desrosiers J, Soumis F. Bombardier Flexjet significantly improves its fractional aircraft ownership operations Interfaces. 35: 49-60. DOI: 10.1287/Inte.1040.0113 |
0.389 |
|
2005 |
Desrosiers J, Mladenović N, Villeneuve D. Design of balanced MBA student teams Journal of the Operational Research Society. 56: 60-66. DOI: 10.1057/Palgrave.Jors.2601775 |
0.542 |
|
2005 |
Villeneuve D, Desrosiers J, Lübbecke ME, Soumis F. On compact formulations for integer programs solved by column generation Annals of Operations Research. 139: 375-388. DOI: 10.1007/S10479-005-3455-9 |
0.596 |
|
2002 |
Stojković G, Soumis F, Desrosiers J, Solomon MM. An optimization model for a real-time flight scheduling problem Transportation Research Part a: Policy and Practice. 36: 779-788. DOI: 10.1016/S0965-8564(01)00039-8 |
0.41 |
|
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.512 |
|
2001 |
Cordeau JF, Stojković G, Soumis F, Desrosiers J. Benders decomposition for simultaneous aircraft routing and crew scheduling Transportation Science. 35: 375-388. DOI: 10.1287/Trsc.35.4.375.10432 |
0.567 |
|
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.491 |
|
2001 |
Cordeau JF, Soumis F, Desrosiers J. Simultaneous assignment of locomotives and cars to passenger trains Operations Research. 49: 531-548. DOI: 10.1287/Opre.49.4.531.11226 |
0.532 |
|
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.493 |
|
2000 |
Cordeau JF, Soumis F, Desrosiers J. Benders decomposition approach for the locomotive and car assignment problem Transportation Science. 34: 133-149. DOI: 10.1287/Trsc.34.2.133.12308 |
0.571 |
|
2000 |
Desrosiers J, Lasry A, Mcinnis D, Solomon MM, Soumis F. Air transat uses ALTITUDE to manage its aircraft routing, crew pairing, and work assignment Interfaces. 30: 41-53. DOI: 10.1287/Inte.30.2.41.11673 |
0.365 |
|
1999 |
Kohl N, Desrosiers J, Madsen OBG, Solomon MM, Soumis F. 2-Path Cuts for the Vehicle Routing Problem with Time Windows Transportation Science. 33: 101-116. DOI: 10.1287/Trsc.33.1.101 |
0.572 |
|
1999 |
Gamache M, Soumis F, Marquis G, Desrosiers J. Column generation approach for large-scale aircrew rostering problems Operations Research. 47: 247-262. DOI: 10.1287/Opre.47.2.247 |
0.502 |
|
1999 |
Ziarati K, Soumis F, Desrosiers J, Solomon MM. Branch-first, cut-second approach for locomotive assignment Management Science. 45: 1156-1168. DOI: 10.1287/Mnsc.45.8.1156 |
0.451 |
|
1999 |
Ioachim I, Desrosiers J, Soumis F, Bélanger N. Fleet assignment and routing with schedule synchronization constraints European Journal of Operational Research. 119: 75-90. DOI: 10.1016/S0377-2217(98)00343-9 |
0.584 |
|
1999 |
Du Merle O, Villeneuve D, Desrosiers J, Hansen P. Stabilized column generation Discrete Mathematics. 194: 229-237. DOI: 10.1016/S0012-365X(98)00213-1 |
0.63 |
|
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.492 |
|
1998 |
Gamache M, Soumis F, Villeneuve D, Desrosiers J, Gélinas E. The preferential bidding system at air Canada Transportation Science. 32: 246-255. DOI: 10.1287/Trsc.32.3.246 |
0.645 |
|
1998 |
Stojković M, Soumis F, Desrosiers J. The operational airline crew scheduling problem Transportation Science. 32: 232-245. DOI: 10.1287/Trsc.32.3.232 |
0.56 |
|
1998 |
Gamache M, Soumis F, Villeneuve D, Desrosiers J, Gelinas E, Peplowski K. The Process of Improvisation Organization Science. 9: 560-561. DOI: 10.1287/Orsc.9.5.560 |
0.41 |
|
1998 |
Ioachim I, Gélinas S, Soumis F, Desrosiers J. A Dynamic Programming Algorithm for the Shortest Path Problem with Time Windows and Linear Node Costs Networks. 31: 193-204. DOI: 10.1002/(Sici)1097-0037(199805)31:3<193::Aid-Net6>3.0.Co;2-A |
0.514 |
|
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.548 |
|
1997 |
Ziarati K, Soumis F, Desrosiers J, Gélinas S, Saintonge A. Locomotive assignment with heterogeneous consists at CN North America European Journal of Operational Research. 97: 281-292. DOI: 10.1016/S0377-2217(96)00198-1 |
0.452 |
|
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.549 |
|
1995 |
Ioachim I, Desrosiers J, Dumas Y, Solomon MM, Villeneuve D. A Request Clustering Algorithm for Door-to-Door Handicapped Transportation Transportation Science. 29: 63-78. DOI: 10.1287/Trsc.29.1.63 |
0.628 |
|
1995 |
Dumas Y, Desrosiers J, Gelinas E, Solomon MM. An Optimal Algorithm for the Traveling Salesman Problem with Time Windows Operations Research. 43: 367-371. DOI: 10.1287/Opre.43.2.367 |
0.541 |
|
1995 |
Gélinas S, Desrochers M, Desrosiers J, Solomon MM. A new branching strategy for time constrained routing problems with application to backhauling Annals of Operations Research. 61: 91-109. DOI: 10.1007/Bf02098283 |
0.5 |
|
1993 |
Langevin A, Desrochers M, Desrosiers J, Gélinas S, Soumis F. A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows Networks. 23: 631-640. DOI: 10.1002/Net.3230230706 |
0.447 |
|
1992 |
Desrochers M, Desrosiers J, Solomon M. A new optimization algorithm for the vehicle routing problem with time windows Operations Research. 40: 342-354. DOI: 10.1287/Opre.40.2.342 |
0.568 |
|
1992 |
Solomon M, Chalifour A, Desrosiers J, Boisvert J. An Application of Vehicle-Routing Methodology to Large-Scale Larvicide Control Programs Interfaces. 22: 88-99. DOI: 10.1287/Inte.22.3.88 |
0.344 |
|
1991 |
Dumas Y, Desrosiers J, Soumis F. The pickup and delivery problem with time windows European Journal of Operational Research. 54: 7-22. DOI: 10.1016/0377-2217(91)90319-Q |
0.518 |
|
1990 |
Dumas Y, Soumis F, Desrosiers J. Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs Transportation Science. 24: 145-152. DOI: 10.1287/Trsc.24.2.145 |
0.483 |
|
1990 |
Langevin A, Soumis F, Desrosiers J. Classification of travelling salesman problem formulations Operations Research Letters. 9: 127-132. DOI: 10.1016/0167-6377(90)90052-7 |
0.458 |
|
1989 |
Dumas Y, Desrosiers J, Soumis F. Minimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables Rairo-Operations Research. 23: 305-317. DOI: 10.1051/Ro/1989230403051 |
0.303 |
|
1988 |
Solomon MM, Desrosiers J. Survey Paper—Time Window Constrained Routing and Scheduling Problems Transportation Science. 22: 1-13. DOI: 10.1287/Trsc.22.1.1 |
0.503 |
|
1988 |
Desrosiers J, Sauvé M, Soumis F. Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows Management Science. 34: 1005-1022. DOI: 10.1287/Mnsc.34.8.1005 |
0.521 |
|
1988 |
Desrosiers J, Laporte G, Sauve M, Soumis F, Taillefer S. Vehicle routing with full loads Computers and Operations Research. 15: 219-226. DOI: 10.1016/0305-0548(88)90034-2 |
0.496 |
|
1986 |
Desrosiers J, Dumas Y, Soumis F. A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows American Journal of Mathematical and Management Sciences. 6: 301-325. DOI: 10.1080/01966324.1986.10737198 |
0.492 |
|
1986 |
Desrosiers J, Soumis F, Desrochers M, SauvéGerad M. Methods for routing with time windows European Journal of Operational Research. 23: 236-245. DOI: 10.1016/0377-2217(86)90243-2 |
0.563 |
|
1984 |
Desrosiers J, Soumis F, Desrochers M. Routing with time windows by column generation Networks. 14: 545-565. DOI: 10.1002/Net.3230140406 |
0.515 |
|
1983 |
Desrosiers J, Soumis F, Desrochers M, Sauve M. VEHICLE ROUTING AND SCHEDULING WITH TIME WINDOWS Mathematical Programming Study. 26: 249-251. |
0.478 |
|
Show low-probability matches. |