| Year |
Citation |
Score |
| 2021 |
Garroppo RG, Nencioni G, Tavanti L, Gendron B, Scutellà MG. Optimal Access Point Power Management for Green IEEE 802.11 Networks. Sensors (Basel, Switzerland). 21. PMID 33809509 DOI: 10.3390/s21062076 |
0.393 |
|
| 2020 |
Khassiba A, Bastin F, Cafieri S, Gendron B, Mongeau M. Two-Stage Stochastic Mixed-Integer Programming with Chance Constraints for Extended Aircraft Arrival Management Transportation Science. 54: 897-919. DOI: 10.1287/Trsc.2020.0991 |
0.448 |
|
| 2020 |
Neumann-Saavedra BA, Crainic TG, Gendron B, Mattfeld DC, Römer M. Integrating Resource Management in Service Network Design for Bike-Sharing Systems Transportation Science. 54: 1251-1271. DOI: 10.1287/Trsc.2019.0950 |
0.356 |
|
| 2020 |
Anjos MF, Gendron B, Joyce-Moniz M. Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel European Journal of Operational Research. 285: 263-278. DOI: 10.1016/J.Ejor.2020.01.055 |
0.472 |
|
| 2020 |
Araujo JA, Santos HG, Gendron B, Jena SD, Brito SS, Souza DS. Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes Computers & Operations Research. 113: 104782. DOI: 10.1016/J.Cor.2019.104782 |
0.514 |
|
| 2019 |
Gendron B. Revisiting Lagrangian relaxation for network design Discrete Applied Mathematics. 261: 203-218. DOI: 10.1016/J.Dam.2018.07.003 |
0.446 |
|
| 2019 |
Morais V, Gendron B, Mateus GR. The p-arborescence star problem: Formulations and exact solution approaches Computers & Operations Research. 102: 91-101. DOI: 10.1016/J.Cor.2018.10.004 |
0.455 |
|
| 2019 |
Gelareh S, Gendron B, Hanafi S, Neamatian Monemi R, Todosijević R. The selective traveling salesman problem with draft limits Journal of Heuristics. 26: 339-352. DOI: 10.1007/S10732-019-09406-Z |
0.565 |
|
| 2018 |
Gendron B, Hanafi S, Todosijević R. Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design European Journal of Operational Research. 268: 70-81. DOI: 10.1016/J.Ejor.2018.01.022 |
0.507 |
|
| 2018 |
Restrepo MI, Gendron B, Rousseau L. Combining Benders decomposition and column generation for multi-activity tour scheduling Computers & Operations Research. 93: 151-165. DOI: 10.1016/J.Cor.2018.01.014 |
0.546 |
|
| 2017 |
Chouman M, Crainic TG, Gendron B. Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design Transportation Science. 51: 650-667. DOI: 10.1287/Trsc.2015.0665 |
0.445 |
|
| 2017 |
Gendron B, Gouveia L. Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems Transportation Science. 51: 629-649. DOI: 10.1287/Trsc.2015.0634 |
0.544 |
|
| 2017 |
Jena SD, Cordeau J, Gendron B. Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities Informs Journal On Computing. 29: 388-404. DOI: 10.1287/Ijoc.2016.0738 |
0.574 |
|
| 2017 |
Restrepo MI, Gendron B, Rousseau L. A two-stage stochastic programming approach for multi-activity tour scheduling European Journal of Operational Research. 262: 620-635. DOI: 10.1016/J.Ejor.2017.04.055 |
0.505 |
|
| 2017 |
Gendron B, Khuong P, Semet F. Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints Computers & Operations Research. 86: 86-93. DOI: 10.1016/J.Cor.2017.02.020 |
0.545 |
|
| 2017 |
Amrouss A, El Hachemi N, Gendreau M, Gendron B. Real-time management of transportation disruptions in forestry Computers & Operations Research. 83: 95-105. DOI: 10.1016/J.Cor.2017.02.008 |
0.404 |
|
| 2017 |
Frangioni A, Gendron B, Gorgone E. On the computational efficiency of subgradient methods: a case study with Lagrangian bounds Mathematical Programming Computation. 9: 573-604. DOI: 10.1007/S12532-017-0120-7 |
0.554 |
|
| 2017 |
Frangioni A, Gendron B, Gorgone E. Dynamic smoothness parameter for fast gradient methods Optimization Letters. 12: 43-53. DOI: 10.1007/S11590-017-1168-Z |
0.394 |
|
| 2016 |
Gendron B, Khuong P, Semet F. A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints Transportation Science. 50: 1286-1299. DOI: 10.1287/Trsc.2016.0692 |
0.563 |
|
| 2016 |
Restrepo MI, Gendron B, Rousseau LM. Branch-and-price for personalized multiactivity tour scheduling Informs Journal On Computing. 28: 334-350. DOI: 10.1287/Ijoc.2015.0683 |
0.542 |
|
| 2016 |
Gendron B, Hanafi S, Todosijević R. An Efficient Matheuristic for the Multicommodity Fixed-Charge Network Design Problem Ifac-Papersonline. 49: 117-120. DOI: 10.1016/J.Ifacol.2016.07.560 |
0.527 |
|
| 2016 |
Gendron B, Scutellà MG, Garroppo RG, Nencioni G, Tavanti L. A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks European Journal of Operational Research. 255: 151-162. DOI: 10.1016/J.Ejor.2016.04.058 |
0.421 |
|
| 2016 |
Todosijević R, Hanafi S, Urošević D, Jarboui B, Gendron B. A general variable neighborhood search for the swap-body vehicle routing problem Computers and Operations Research. DOI: 10.1016/J.Cor.2016.01.016 |
0.464 |
|
| 2016 |
Jena SD, Cordeau JF, Gendron B. Solving a dynamic facility location problem with partial closing and reopening Computers and Operations Research. 67: 143-154. DOI: 10.1016/J.Cor.2015.10.011 |
0.599 |
|
| 2015 |
Jena SD, Cordeau JF, Gendron B. Dynamic facility location with generalized modular capacities Transportation Science. 49: 484-499. DOI: 10.1287/Trsc.2014.0575 |
0.557 |
|
| 2015 |
Thiongane B, Cordeau JF, Gendron B. Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem Computers and Operations Research. 53: 1-8. DOI: 10.1016/J.Cor.2014.07.013 |
0.516 |
|
| 2015 |
Gendron B, Khuong PV, Semet F. Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment Networks. 66: 214-234. DOI: 10.1002/Net.21626 |
0.68 |
|
| 2015 |
Da Cunha AS, Simonetti L, Lucena A, Gendron B. Formulations and exact solution approaches for the degree preserving spanning tree problem Networks. 65: 329-343. DOI: 10.1002/Net.21590 |
0.519 |
|
| 2014 |
Gendron B, Lucena A, Da Cunha AS, Simonetti L. Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem Informs Journal On Computing. 26: 645-657. DOI: 10.1287/Ijoc.2013.0589 |
0.468 |
|
| 2014 |
Contardo C, Cordeau JF, Gendron B. An exact algorithm based on cut-and-column generation for the capacitated location-routing problem Informs Journal On Computing. 26: 88-102. DOI: 10.1287/Ijoc.2013.0549 |
0.772 |
|
| 2014 |
Garroppo RG, Nencioni G, Tavanti L, Gendron B. The greening potential of content delivery in residential community networks Computer Networks. 73: 256-267. DOI: 10.1016/J.Comnet.2014.08.016 |
0.387 |
|
| 2014 |
Todosijević R, Mjirda A, Mladenović M, Hanafi S, Gendron B. A general variable neighborhood search variants for the travelling salesman problem with draft limits Optimization Letters. DOI: 10.1007/s11590-014-0788-9 |
0.429 |
|
| 2014 |
Boyer V, Gendron B, Rousseau LM. A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem Journal of Scheduling. 17: 185-197. DOI: 10.1007/S10951-013-0338-9 |
0.513 |
|
| 2014 |
Contardo C, Cordeau JF, Gendron B. A GRASP + ILP-based metaheuristic for the capacitated location-routing problem Journal of Heuristics. 20: 1-38. DOI: 10.1007/S10732-013-9230-1 |
0.739 |
|
| 2014 |
Garroppo RG, Gendron B, Nencioni G, Tavanti L. Energy efficiency and traffic offloading in wireless mesh networks with delay bounds International Journal of Communication Systems. 30: e2902. DOI: 10.1002/Dac.2902 |
0.367 |
|
| 2013 |
Côté MC, Gendron B, Rousseau LM. Grammar-based column generation for personalized multi-activity shift scheduling Informs Journal On Computing. 25: 461-474. DOI: 10.1287/Ijoc.1120.0514 |
0.564 |
|
| 2013 |
Gendron B, Garroppo RG, Nencioni G, Scutellà MG, Tavanti L. Benders decomposition for a location-design problem in green wireless local area networks Electronic Notes in Discrete Mathematics. 41: 367-374. DOI: 10.1016/J.Endm.2013.05.114 |
0.527 |
|
| 2013 |
Gendron B, Lucena A, Salles da Cunha A, Simonetti L. The degree preserving spanning tree problem: Valid inequalities and branch-and-cut method Electronic Notes in Discrete Mathematics. 41: 173-180. DOI: 10.1016/J.Endm.2013.05.090 |
0.436 |
|
| 2013 |
Contardo C, Cordeau JF, Gendron B. A computational comparison of flow formulations for the capacitated location-routing problem Discrete Optimization. DOI: 10.1016/J.Disopt.2013.07.005 |
0.722 |
|
| 2013 |
Gollowitzer S, Gendron B, Ljubić I. A cutting plane algorithm for the Capacitated Connected Facility Location Problem Computational Optimization and Applications. 55: 647-674. DOI: 10.1007/S10589-013-9544-9 |
0.555 |
|
| 2013 |
Frangioni A, Gendron B. A stabilized structured Dantzig-Wolfe decomposition method Mathematical Programming. 140: 45-76. DOI: 10.1007/S10107-012-0626-8 |
0.454 |
|
| 2013 |
Todosijević R, Mjirda A, Hanafi S, Mladenović N, Gendron B. A general variable neighborhood search for the travelling salesman problem with draft limits Proceedings of 2013 International Conference On Industrial Engineering and Systems Management, Ieee - Iesm 2013. |
0.427 |
|
| 2012 |
Costa AM, Cordeau JF, Gendron B, Laporte G. Accelerating Benders decomposition with heuristic master problem solutions Pesquisa Operacional. 32: 3-19. DOI: 10.1590/S0101-74382012005000005 |
0.557 |
|
| 2012 |
Jena SD, Cordeau JF, Gendron B. Modeling and solving a logging camp location problem Annals of Operations Research. 1-27. DOI: 10.1007/S10479-012-1278-Z |
0.521 |
|
| 2011 |
Côté MC, Gendron B, Rousseau LM. Grammar-based integer programming models for multiactivity shift scheduling Management Science. 57: 151-163. DOI: 10.1287/Mnsc.1100.1264 |
0.518 |
|
| 2011 |
Gendron B. Decomposition methods for network design Procedia - Social and Behavioral Sciences. 20: 31-37. DOI: 10.1016/J.Sbspro.2011.08.006 |
0.437 |
|
| 2011 |
Côté MC, Gendron B, Quimper CG, Rousseau LM. Formal languages for integer programming modeling of shift scheduling problems Constraints. 16: 54-76. DOI: 10.1007/S10601-009-9083-2 |
0.478 |
|
| 2010 |
Côté MC, Gendron B, Rousseau LM. Grammar-based integer programming models for multi-activity shift scheduling Electronic Notes in Discrete Mathematics. 36: 727-734. DOI: 10.1016/j.endm.2010.05.092 |
0.402 |
|
| 2009 |
Frangioni A, Gendron B. 0-1 reformulations of the multicommodity capacitated network design problem Discrete Applied Mathematics. 157: 1229-1241. DOI: 10.1016/J.Dam.2008.04.022 |
0.504 |
|
| 2009 |
Pesant G, Sellmann M, Gendron B. Special issue on constraint programming Computers and Operations Research. 36: 2329. DOI: 10.1016/J.Cor.2008.08.011 |
0.325 |
|
| 2009 |
Gendron B, Semet F. Formulations and relaxations for a multi-echelon capacitated location-distribution problem Computers and Operations Research. 36: 1335-1355. DOI: 10.1016/J.Cor.2008.02.009 |
0.485 |
|
| 2009 |
Costa AM, Cordeau JF, Gendron B. Benders, metric and cutset inequalities for multicommodity capacitated network design Computational Optimization and Applications. 42: 371-392. DOI: 10.1007/S10589-007-9122-0 |
0.373 |
|
| 2008 |
Gendron B, Hertz A, St-Louis P. On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem Operations Research Letters. 36: 345-350. DOI: 10.1016/J.Orl.2007.09.004 |
0.476 |
|
| 2008 |
Gendron B, Hertz A, St-Louis P. A sequential elimination algorithm for computing bounds on the clique number of a graph Discrete Optimization. 5: 615-628. DOI: 10.1016/J.Disopt.2008.01.001 |
0.397 |
|
| 2008 |
De Souza MC, Mahey P, Gendron B. Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs Networks. 51: 133-141. DOI: 10.1002/Net.V51:2 |
0.442 |
|
| 2007 |
Croxton KL, Gendron B, Magnanti TL. Variable disaggregation in network flow problems with piecewise linear costs Operations Research. 55: 146-157. DOI: 10.1287/Opre.1060.0314 |
0.558 |
|
| 2007 |
Gendron B, Hertz A, St-Louis P. On edge orienting methods for graph coloring Journal of Combinatorial Optimization. 13: 163-178. DOI: 10.1007/S10878-006-9019-3 |
0.394 |
|
| 2007 |
Côté MC, Gendron B, Rousseau LM. Modeling the regular constraint with integer programming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4510: 29-43. |
0.447 |
|
| 2006 |
Gendreau M, Ferland J, Gendron B, Hail N, Jaumard B, Lapierre S, Pesant G, Soriano P. Physician scheduling in emergency rooms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3867: 53-66. |
0.388 |
|
| 2005 |
Gendron B. Scheduling employees in Quebec's liquor stores with integer programming Interfaces. 35: 402-410. DOI: 10.1287/Inte.1050.0154 |
0.379 |
|
| 2005 |
Gendron B, Lebbah H, Pesant G. Improving the cooperation between the master problem and the subproblem in constraint programming based column generation Lecture Notes in Computer Science. 3524: 217-227. |
0.493 |
|
| 2004 |
Persson JA, Göthe-Lundgren M, Lundgren JT, Gendron B. A tabu search heuristic for scheduling the production processes at an oil refinery International Journal of Production Research. 42: 445-471. DOI: 10.1080/00207540310001613656 |
0.455 |
|
| 2004 |
Crainic TG, Gendron B, Hernu G. A slope scaling/lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design Journal of Heuristics. 10: 525-545. DOI: 10.1023/B:Heur.0000045323.83583.Bd |
0.465 |
|
| 2003 |
Croxton KL, Gendron B, Magnanti TL. Models and methods for merge-in-transit operations Transportation Science. 37: 1-22. DOI: 10.1287/Trsc.37.1.1.12822 |
0.519 |
|
| 2003 |
Croxton KL, Gendron B, Magnanti TL. A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems Management Science. 49: 1268-1273. DOI: 10.1287/Mnsc.49.9.1268.16570 |
0.47 |
|
| 2003 |
Croxton KL, Gendron B, Magnanti TL, Axsäter S, Nerkar A, Delquié P. Optimal Conflict in Preference Assessment Management Science. 49: 0-0. DOI: 10.1287/Mnsc.49.1.102.12751 |
0.309 |
|
| 2003 |
Chouman M, Crainic TG, Gendron B. Revue Des Inégalités Valides Pertinentes Aux Problèmes Des Conception De Réseaux Infor: Information Systems and Operational Research. 41: 5-33. DOI: 10.1080/03155986.2003.11732666 |
0.535 |
|
| 2003 |
Gendron B, Potvin JY, Soriano P. A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements Annals of Operations Research. 122: 193-217. DOI: 10.1023/A:1026102724889 |
0.532 |
|
| 2003 |
Gendron B, Potvin JY, Soriano P. A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements Parallel Computing. 29: 591-606. DOI: 10.1016/S0167-8191(03)00044-9 |
0.306 |
|
| 2003 |
Chouman M, Crainic TG, Gendron B. Review of pertinent valid inequalities to the problem of network design Infor Journal. 41: 5-33. |
0.453 |
|
| 2002 |
Gendron B, Potvin JY, Soriano P. Diversification strategies in local search for a nonbifurcated network loading problem European Journal of Operational Research. 142: 231-241. DOI: 10.1016/S0377-2217(02)00263-1 |
0.493 |
|
| 2002 |
Gendron B. A note on "a dual-ascent approach to the fixed-charge capacitated network design problem", European Journal of Operational Research. 138: 671-675. DOI: 10.1016/S0377-2217(01)00110-2 |
0.439 |
|
| 2001 |
Crainic TG, Frangioni A, Gendron B. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design Discrete Applied Mathematics. 112: 73-99. DOI: 10.1016/S0166-218X(00)00310-3 |
0.388 |
|
| 2000 |
Beaulieu H, Ferland JA, Gendron B, Michelon P. A mathematical programming approach for scheduling physicians in the emergency room Health Care Management Science. 3: 193-200. PMID 10907322 DOI: 10.1023/A:1019009928005 |
0.33 |
|
| 2000 |
Berger D, Gendron B, Potvin JY, Raghavan S, Soriano P. Tabu search for a network loading problem with multiple facilities Journal of Heuristics. 6: 253-267. DOI: 10.1023/A:1009679511137 |
0.426 |
|
| 2000 |
Bourbeau B, Gabriel Crainic T, Gendron B. Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem Parallel Computing. 26: 27-46. DOI: 10.1016/S0167-8191(99)00094-0 |
0.449 |
|
| 1999 |
Gendron B, Potvin JY, Soriano P. Tabu search with exact neighbor evaluation for multicommodity location with balancing requirements Infor Journal. 37. DOI: 10.1080/03155986.1999.11732384 |
0.514 |
|
| 1997 |
Gendron B, Crainic TG. A parallel branch-and-bound algorithm for multicommodity location with balancing requirements Computers and Operations Research. 24: 829-847. DOI: 10.1016/S0305-0548(96)00094-9 |
0.47 |
|
| 1995 |
Gendron B, Crainic TG. A branch-and-bound algorithm for depot location and container fleet management Location Science. 3: 39-53. DOI: 10.1016/0966-8349(95)00005-3 |
0.485 |
|
| 1994 |
Gendron B, Crainic TG. Parallel Branch-and-Branch Algorithms: Survey and Synthesis Operations Research. 42: 1042-1066. DOI: 10.1287/Opre.42.6.1042 |
0.341 |
|
| 1993 |
Gendron B, Crainic TG. Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements Infor: Information Systems and Operational Research. 31: 151-165. DOI: 10.1080/03155986.1993.11732224 |
0.427 |
|
| Show low-probability matches. |