( en | de | ru )

 

Disambiguation of "Gendron, Bernard"

Author of the publication

copydeleteadd this publication to your clipboard
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem.

, , and . INFORMS J. Comput., 26 (1): 88-102 (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Quentin Gendron

Élise Gendron

Dirk Bernard

Bernard Willkofer

Bernard Broermann

 

Other publications of authors with the same name

Special issue on constraint programming., , and . Comput. Oper. Res., 36 (8): 2329 (2009)Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks., , , , and . Electron. Notes Discret. Math., (2013)Revisiting Lagrangian relaxation for network design.. Discret. Appl. Math., (2019)An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem., , and . INFORMS J. Comput., 26 (1): 88-102 (2014)Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling., , and . Manag. Sci., 57 (1): 151-163 (2011)On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem., , and . Oper. Res. Lett., 36 (3): 345-350 (2008)A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements., , and . Comput. Oper. Res., (2022)The selective traveling salesman problem with draft limits., , , , and . J. Heuristics, 26 (3): 339-352 (2020)A computational comparison of flow formulations for the capacitated location-routing problem., , and . Discret. Optim., 10 (4): 263-295 (2013)Bundle-based relaxation methods for multicommodity capacitated fixed charge network design., , and . Discret. Appl. Math., 112 (1-3): 73-99 (2001)