دنبال کردن
Paolo Toth
Paolo Toth
Università di Bologna
ایمیل تأیید شده در unibo.it
عنوان
نقل شده توسط
نقل شده توسط
سال
The vehicle routing problem‏
P Toth, D Vigo‏
Society for Industrial and Applied Mathematics, 2002‏
7690*2002
Knapsack problems: algorithms and computer implementations‏
S Martello, P Toth‏
John Wiley & Sons, Inc., 1990‏
64871990
The vehicle routing problem‏
N Christofides‏
Combinatorial optimization, 1979‏
15281979
A survey of optimization models for train routing and scheduling‏
JF Cordeau, P Toth, D Vigo‏
Transportation science 32 (4), 380-404, 1998‏
10761998
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‏
9221981
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‏
8252014
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‏
8212003
Modeling and solving the train timetabling problem‏
A Caprara, M Fischetti, P Toth‏
Operations research 50 (5), 851-861, 2002‏
7932002
Models, relaxations and exact approaches for the capacitated vehicle routing problem‏
P Toth, D Vigo‏
Discrete Applied Mathematics 123 (1-3), 487-512, 2002‏
7252002
An overview of vehicle routing problems‏
P Toth, D Vigo‏
The vehicle routing problem, 1-26, 2002‏
6732002
Algorithms for the set covering problem‏
A Caprara, P Toth, M Fischetti‏
Annals of Operations Research 98 (1), 353-371, 2000‏
6252000
A heuristic method for the set covering problem‏
A Caprara, M Fischetti, P Toth‏
Operations research 47 (5), 730-743, 1999‏
6241999
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‏
5971997
Dynamic programming and strong bounds for the 0-1 knapsack problem‏
S Martello, D Pisinger, P Toth‏
Management science 45 (3), 414-424, 1999‏
5891999
State‐space relaxation procedures for the computation of bounds to routing problems‏
N Christofides, A Mingozzi, P Toth‏
Networks 11 (2), 145-164, 1981‏
5281981
Nominal and robust train timetabling problems‏
V Cacchiani, P Toth‏
European Journal of Operational Research 219 (3), 727-737, 2012‏
4872012
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‏
4582000
Solving the orienteering problem through branch-and-cut‏
M Fischetti, JJS Gonzalez, P Toth‏
INFORMS Journal on Computing 10 (2), 133-148, 1998‏
4301998
Passenger railway optimization‏
A Caprara, L Kroon, M Monaci, M Peeters, P Toth‏
Handbooks in operations research and management science 14, 129-187, 2007‏
4292007
Lower bounds and reduction procedures for the bin packing problem‏
S Martello, P Toth‏
Discrete applied mathematics 28 (1), 59-70, 1990‏
4191990
سیستم در حال حاضر قادر به انجام عملکرد نیست. بعداً دوباره امتحان کنید.
مقاله‌ها 1–20