( en | de | ru )

 

Disambiguation of "Cordeau, Jean-François"

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.

Jean-François Stumper

Jean-François Viaud

Jean-François Paillotin

Jean François Savoie

Jean-François Hren

 

Other publications of authors with the same name

A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine., , and . J. Sched., 12 (1): 3-16 (2009)An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading., , and . INFOR Inf. Syst. Oper. Res., 45 (4): 223-238 (2007)Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling., , , and . Transp. Sci., 35 (4): 375-388 (2001)A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem., , and . Comput. Oper. Res., (2016)A branch-and-cut algorithm for an assembly routing problem., , and . Eur. J. Oper. Res., 282 (3): 896-910 (2020)Benders decomposition for very large scale partial set covering and maximal covering location problems., , and . Eur. J. Oper. Res., 275 (3): 882-896 (2019)Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds., , , and . Eur. J. Oper. Res., 259 (3): 829-846 (2017)Minimizing user inconvenience and operational costs in a dial-a-flight problem for flying safaris., , , , and . INFOR Inf. Syst. Oper. Res., 61 (1): 104-140 (January 2023)A Decision Support System for Attended Home Services., , , , , and . INFORMS J. Appl. Anal., 50 (2): 137-152 (2020)A Branch-and-Cut Algorithm for the Dial-a-Ride Problem.. Operations Research, 54 (3): 573-586 (2006)