The vehicle routing problem P Toth, D Vigo Society for Industrial and Applied Mathematics, 2002 | 7275* | 2002 |
Knapsack problems: algorithms and computer implementations S Martello, P Toth John Wiley & Sons, Inc., 1990 | 6363 | 1990 |
The vehicle routing problem N Christofides Combinatorial optimization, 1979 | 1544 | 1979 |
A survey of optimization models for train routing and scheduling JF Cordeau, P Toth, D Vigo Transportation science 32 (4), 380-404, 1998 | 1063 | 1998 |
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations N Christofides, A Mingozzi, P Toth Mathematical programming 20, 255-282, 1981 | 911 | 1981 |
The granular tabu search and its application to the vehicle-routing problem P Toth, D Vigo Informs Journal on computing 15 (4), 333-346, 2003 | 801 | 2003 |
An overview of recovery models and algorithms for real-time railway rescheduling V Cacchiani, D Huisman, M Kidd, L Kroon, P Toth, L Veelenturf, ... Transportation Research Part B: Methodological 63, 15-37, 2014 | 778 | 2014 |
Modeling and solving the train timetabling problem A Caprara, M Fischetti, P Toth Operations research 50 (5), 851-861, 2002 | 775 | 2002 |
Models, relaxations and exact approaches for the capacitated vehicle routing problem P Toth, D Vigo Discrete Applied Mathematics 123 (1-3), 487-512, 2002 | 709 | 2002 |
Routing Problems P Toth, D Vigo | 634 | 1998 |
A heuristic method for the set covering problem A Caprara, M Fischetti, P Toth Operations research 47 (5), 730-743, 1999 | 616 | 1999 |
Algorithms for the set covering problem A Caprara, P Toth, M Fischetti Annals of Operations Research 98 (1), 353-371, 2000 | 600 | 2000 |
A branch-and-cut algorithm for the symmetric generalized traveling salesman problem M Fischetti, JJ Salazar González, P Toth Operations Research 45 (3), 378-394, 1997 | 596 | 1997 |
Dynamic programming and strong bounds for the 0-1 knapsack problem S Martello, D Pisinger, P Toth Management science 45 (3), 414-424, 1999 | 568 | 1999 |
State‐space relaxation procedures for the computation of bounds to routing problems N Christofides, A Mingozzi, P Toth Networks 11 (2), 145-164, 1981 | 524 | 1981 |
Nominal and robust train timetabling problems V Cacchiani, P Toth European Journal of Operational Research 219 (3), 727-737, 2012 | 467 | 2012 |
New trends in exact algorithms for the 0–1 knapsack problem S Martello, D Pisinger, P Toth European Journal of Operational Research 123 (2), 325-332, 2000 | 450 | 2000 |
Passenger railway optimization A Caprara, L Kroon, M Monaci, M Peeters, P Toth Handbooks in operations research and management science 14, 129-187, 2007 | 418 | 2007 |
Solving the orienteering problem through branch-and-cut M Fischetti, JJS Gonzalez, P Toth INFORMS Journal on Computing 10 (2), 133-148, 1998 | 415 | 1998 |
Lower bounds and reduction procedures for the bin packing problem S Martello, P Toth Discrete applied mathematics 28 (1), 59-70, 1990 | 399 | 1990 |