Author of the publication

A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs.

, , and . Operations Research, 42 (5): 846-859 (1994)

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 Freight Service Design Problem for a Railway Corridor., , and . Transp. Sci., 45 (2): 147-162 (2011)Knapsack problems: algorithms and computer implementations, , and . John Wiley & Sons, Inc., New York, NY, USA, (1990)Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations., , and . Math. Program., 20 (1): 255-282 (1981)Solving a real-world train-unit assignment problem., , and . Math. Program., 124 (1-2): 207-231 (2010)Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem., , , and . Eur. J. Oper. Res., 291 (3): 871-882 (2021)Route 2005: Recent advances in vehicle routing optimization., , and . Networks, 49 (4): 243-244 (2007)Generalized Assignment Problems., and . ISAAC, volume 650 of Lecture Notes in Computer Science, page 351-369. Springer, (1992)Approximation Algorithms for Fixed Job Schedule Problems., , and . Operations Research, 40 (Supplement-1): S96-S108 (1992)An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines., , and . IPCO, page 181-200. Carnegie Mellon University, (1992)A Heuristic Algorithm for the Set Covering Problem., , and . IPCO, volume 1084 of Lecture Notes in Computer Science, page 72-84. Springer, (1996)