Author of the publication

Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks.

, , , and . CPAIOR, volume 10335 of Lecture Notes in Computer Science, page 254-262. Springer, (2017)

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.

 

Other publications of authors with the same name

A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case., , and . Math. Program., 95 (1): 71-90 (2003)Sequence Independent Lifting in Mixed Integer Programming., , and . J. Comb. Optim., 4 (1): 109-129 (2000)Analysis of bounds for a capacitated single-item lot-sizing problem., , and . Comput. Oper. Res., 34 (6): 1721-1743 (2007)A decision support tool for generating shipping data for the Hunter Valley coal chain., , and . Comput. Oper. Res., (2015)Incremental network design with maximum flows., , and . Eur. J. Oper. Res., 242 (1): 51-62 (2015)Optimization for dynamic ride-sharing: A review., , , and . Eur. J. Oper. Res., 223 (2): 295-303 (2012)On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra., , and . Eur. J. Oper. Res., 125 (2): 298-315 (2000)The bi-objective mixed capacitated general routing problem with different route balance criteria., and . Eur. J. Oper. Res., 251 (2): 451-465 (2016)A new method for optimizing a linear function over the efficient set of a multiobjective integer program., , and . Eur. J. Oper. Res., 260 (3): 904-919 (2017)The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs., , and . Eur. J. Oper. Res., 260 (3): 873-885 (2017)