Author of the publication

Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows.

, , and . Comput. Oper. Res., 40 (8): 2004-2010 (2013)

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 Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem., , and . IEEE Access, (2013)A penalty function heuristic for the resource constrained shortest path problem., , and . Eur. J. Oper. Res., 142 (2): 221-230 (2002)Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable., , and . INFORMS J. Comput., 24 (1): 165-171 (2012)Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches., , and . INFORMS J. Comput., 32 (4): 1049-1060 (2020)An effective heuristic for large-scale capacitated facility location problems., , , and . J. Heuristics, 15 (6): 597-615 (2009)The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming., , and . Networks, 62 (4): 315-326 (2013)Resource Constrained Shortest Path Problems in Path Planning for Fleet Management., , and . J. Math. Model. Algorithms, 3 (1): 1-17 (2004)A computational study of exact knapsack separation for the generalized assignment problem., , and . Comput. Optim. Appl., 45 (3): 543-555 (2010)A new MILP formulation for the flying sidekick traveling salesman problem., , , and . Networks, 82 (3): 254-276 (October 2023)Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows., , and . Comput. Oper. Res., 40 (8): 2004-2010 (2013)