Paolo Toth
TitoloCitata daAnno
Knapsack problems: algorithms and computer implementations
S Martello
Wiley-Interscience series in discrete mathematics and optimiza tion, 1990
50291990
The vehicle routing problem
P Toth, D Vigo
Society for Industrial and Applied Mathematics, 2002
4356*2002
A survey of optimization models for train routing and scheduling
JF Cordeau, P Toth, D Vigo
Transportation science 32 (4), 380-404, 1998
8141998
AN ADDITIVE APPROACH FOR THE OPTIMAL SOLUTION OF THE PRIZE-COLLECTING TRAVELLING SALESMAN PROBLEM. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND …
M Fischetti, P Toth
Publication of: Dalctraf, 1988
7331988
Vehicle routing
N Christofides
The traveling salesman problem, 1985
718*1985
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
N Christofides, A Mingozzi, P Toth
Mathematical programming 20 (1), 255-282, 1981
6461981
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
5672003
A heuristic method for the set covering problem
A Caprara, M Fischetti, P Toth
Operations research 47 (5), 730-743, 1999
4921999
Modeling and solving the train timetabling problem
A Caprara, M Fischetti, P Toth
Operations research 50 (5), 851-861, 2002
4812002
Models, relaxations and exact approaches for the capacitated vehicle routing problem
P Toth, D Vigo
Discrete Applied Mathematics 123 (1-3), 487-512, 2002
4602002
Algorithms for the set covering problem
A Caprara, P Toth, M Fischetti
Annals of Operations Research 98 (1-4), 353-371, 2000
4312000
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
4111997
An overview of vehicle routing problems
P Toth, D Vigo
The vehicle routing problem, 1-26, 2002
4042002
State‐space relaxation procedures for the computation of bounds to routing problems
N Christofides, A Mingozzi, P Toth
Networks 11 (2), 145-164, 1981
3821981
Dynamic programming and strong bounds for the 0-1 knapsack problem
S Martello, D Pisinger, P Toth
Management Science 45 (3), 414-424, 1999
3661999
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
3372000
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
3252014
Lower bounds and reduction procedures for the bin packing problem
S Martello, P Toth
Discrete applied mathematics 28 (1), 59-70, 1990
2991990
Branch and bound methods for the traveling salesman problem
E Balas, P Toth
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP, 1983
2961983
Passenger railway optimization
A Caprara, L Kroon, M Monaci, M Peeters, P Toth
Handbooks in operations research and management science 14, 129-187, 2007
2802007
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20