Paolo Toth

Q: What Schools Are Affiliated With Paolo Toth

Paolo Toth is affiliated with the following schools: University of Florence, University of Bologna

Paolo Toth's AcademicInfluence.com Rankings

Paolo Toth

Engineering

#3034

World Rank

#4050

Historical Rank

Electronic Engineering

World Rank

Historical Rank

Applied Physics

#551

World Rank

#571

Historical Rank

Electrical Engineering

#692

World Rank

#756

Historical Rank

engineering Degrees

Download Badge

Engineering

Why Is Paolo Toth Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Paolo Toth is an Italian scientist and engineer, and an Emeritus Professor of Operations Research at the University of Bologna. He is known for his research in operations research and mathematical programming. He made significant contributions in the areas of vehicle routing, knapsack and other cutting and packing problems, train scheduling, set covering, vertex coloring and, in general, combinatorial optimization. As of 2023, he published over 170 peer-reviewed articles and was cited more than 10,000 times.

(See a Problem?)

Paolo Toth's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Knapsack Problems: Algorithms and Computer Implementations (1990) (3843)
The vehicle routing problem (2001) (2477)
Models, relaxations and exact approaches for the capacitated vehicle routing problem (2002) (1002)
A Survey of Optimization Models for Train Routing and Scheduling (1998) (803)
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem (2003) (561)
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations (1981) (553)
An overview of recovery models and algorithms for real-time railway rescheduling (2014) (522)
Modeling and Solving the Train Timetabling Problem (2002) (515)
A Heuristic Method for the Set Covering Problem (1999) (461)
Algorithms for the Set Covering Problem (2000) (428)
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem (1999) (416)
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (1997) (405)
Vehicle Routing: Problems, Methods, and Applications, Second Edition (2014) (381)
Nominal and robust train timetabling problems (2012) (357)
State-space relaxation procedures for the computation of bounds to routing problems (1981) (355)
An Overview of Vehicle Routing Problems (2002) (354)
Algorithms for Knapsack Problems (1987) (336)
New trends in exact algorithms for the 0-1 knapsack problem (2000) (321)
Solving the Orienteering Problem through Branch-and-Cut (1998) (318)
Lower bounds and reduction procedures for the bin packing problem (1990) (286)
A survey on vertex coloring problems (2010) (241)
Heuristic Algorithms for the Handicapped Persons Transportation Problem (1997) (239)
An Exact Algorithm for the Vehicle Routing Problem with Backhauls (1997) (229)
A Lagrangian heuristic algorithm for a real-world train timetabling problem (2006) (224)
Algorithms for railway crew management (1997) (218)
Exact Solution of the Quadratic Knapsack Problem (1999) (197)
Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem (1980) (196)
Scheduling extra freight trains on railway networks (2010) (194)
Chapter 3 Passenger Railway Optimization (2007) (193)
On the optimal design of water distribution networks: a practical MINLP approach (2012) (173)
Exact algorithms for routing problems under vehicle capacity constraints (2010) (170)
Algorithms and codes for the assignment problem (1988) (163)
An upper bound for the zero-one knapsack problem and a branch and bound algorithm (1977) (162)
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls (1999) (159)
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem (2013) (153)
Modeling and Solving the Crew Rostering Problem (1998) (148)
A column generation approach to train timetabling on a corridor (2008) (147)
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs (1994) (146)
A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions (2014) (143)
A Metaheuristic Approach for the Vertex Coloring Problem (2008) (142)
A New Algorithm for the 0-1 Knapsack Problem (1988) (142)
A branch and bound algorithm for the multiple depot vehicle scheduling problem (1989) (142)
Algorithms and codes for dense assignment problems: the state of the art (2000) (131)
Exact solution of large-scale, asymmetric traveling salesman problems (1995) (130)
A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem (2014) (128)
Dynamic programming algorithms for the Zero-One Knapsack Problem (1980) (124)
A new ILP-based refinement heuristic for Vehicle Routing Problems (2006) (124)
Recent advances in vehicle routing exact algorithms (2007) (123)
An Additive Bounding Procedure for Combinatorial Optimization Problems (1989) (120)
The symmetric generalized traveling salesman polytope (1995) (120)
An exact approach for the Vertex Coloring Problem (2011) (119)
Algorithms for the Bin Packing Problem with Conflicts (2010) (117)
Algorithm 548: Solution of the Assignment Problem [H] (1980) (116)
Linear Assignment Problems (1987) (113)
Lower bounds and algorithms for the 2-dimensional vector packing problem (2001) (113)
Heuristic algorithms for the multiple depot vehicle scheduling problem (1993) (112)
Balanced optimization problems (1984) (105)
A Polyhedral Approach to the Asymmetric Traveling Salesman Problem (1997) (105)
The Fixed Job Schedule Problem with Spread-Time Constraints (1987) (101)
The Family of Vehicle Routing Problems (2014) (99)
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines (1997) (98)
An additive bounding procedure for the asymmetric travelling salesman problem (1992) (98)
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (1997) (97)
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems (2006) (96)
Branch-And-Bound Algorithms for the Capacitated VRP (2002) (95)
Fast Local Search Algorithms for the Handicapped Persons Transportation Problem (1996) (93)
Exact Solution of the Vehicle Routing Problem (1998) (91)
A three-level framework for performance-based railway timetabling (2015) (91)
A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem (2014) (91)
An ILP improvement procedure for the Open Vehicle Routing Problem (2008) (88)
An electromagnetism metaheuristic for the unicost set covering problem (2010) (88)
An Exact Algorithm for the Multitrip Vehicle Routing Problem (2013) (86)
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison (2012) (85)
Solution of the Train Platforming Problem (2011) (80)
Branch and Bound Methods for the Traveling Salesman Problem (1983) (80)
Railway Rolling Stock Planning: Robustness Against Large Disruptions (2012) (80)
The Generalized Covering Salesman Problem (2009) (79)
The Generalized Traveling Salesman and Orienteering Problems (2007) (77)
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems (2001) (73)
Heuristic algorithms for the multiple knapsack problem (1981) (73)
Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience (1999) (73)
Solution of the zero-one multiple knapsack problem (1980) (73)
Models and algorithms for a staff scheduling problem (2003) (72)
Train timetabling by skip-stop planning in highly congested lines (2017) (71)
A Bound and Bound algorithm for the zero-one multiple knapsack problem (1981) (70)
An overview of curriculum-based course timetabling (2015) (69)
Improved rolling horizon approaches to the aircraft sequencing problem (2015) (68)
AN ADDITIVE APPROACH FOR THE OPTIMAL SOLUTION OF THE PRIZE-COLLECTING TRAVELLING SALESMAN PROBLEM. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 (1988) (65)
Non-cyclic train timetabling and comparability graphs (2010) (64)
VRP with Backhauls (2002) (64)
A Heuristic Algorithm for the Set Covering Problem (1996) (63)
Exact Methods for the Asymmetric Traveling Salesman Problem (2007) (62)
The Fixed Job Schedule Problem with Working-Time Constraints (1989) (62)
Algorithms and computer implementations (1990) (62)
Solving a real-world train-unit assignment problem (2010) (61)
A parallel shortest augmenting path algorithm for the assignment problem (1991) (61)
A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem (1984) (61)
An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem (2003) (58)
An MINLP Solution Method for a Water Network Problem (2006) (56)
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (2012) (53)
A heuristic approach to the bus driver scheduling problem (1986) (51)
Integrating constraint logic programming and operations research techniques for the Crew Rostering Problem (1998) (51)
Advanced Methods in Transportation Analysis (1997) (51)
Vehicle routing: historical perspective and recent contributions (2013) (50)
Approximation Algorithms for Fixed Job Schedule Problems (1992) (49)
Solution of real-world train timetabling problems (2001) (49)
An exact algorithm for large unbounded knapsack problems (1990) (49)
A new lower bound for curriculum-based course timetabling (2013) (48)
An evolutionary approach for bandwidth multicoloring problems (2008) (47)
A Global Method for Crew Planning in Railway Applications (2001) (47)
A heuristic procedure for the Capacitated m-Ring-Star problem (2010) (45)
A Lagrangian heuristic for a train-unit assignment problem (2013) (43)
Optimization Problems in Passenger Railway Systems (2011) (42)
The bottleneck generalized assignment problem (1995) (42)
Worst-case analysis of greedy algorithms for the subset-sum problem (1984) (42)
Most and least uniform spanning trees (1986) (41)
An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs (1993) (41)
Approaches to real world two-dimensional cutting problems (2014) (40)
A tutorial on non-periodic train timetabling and platforming problems (2015) (40)
Handbook of Optimization in the Railway Industry (2018) (39)
An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (2008) (39)
Classical Exact Algorithms for the Capacitated Vehicle Routing Problem (2014) (36)
A Heuristic Algorithm for the Vehicle Routing Problem with Backhauls (1996) (36)
Primal-dual algrorithms for the assignment problem (1987) (35)
Models and heuristic algorithms for a weighted vertex coloring problem (2009) (34)
The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace (2016) (34)
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (2000) (33)
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems (2013) (33)
Contributions to the quadratic assignment problem (1980) (33)
A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM (1989) (32)
An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem (2012) (32)
Water Network Design by MINLP (2008) (31)
Generalized Assignment Problems (1992) (28)
Solving a Real-World Train Unit Assignment Problem (2007) (27)
Aircraft Sequencing Problems via a Rolling Horizon Algorithm (2012) (26)
A new dominance procedure for combinatorial optimization problems (1988) (25)
Algorithm 632: A program for the 0–1 multiple knapsack problem (1985) (25)
A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem (2014) (24)
Algorithm 750: CDT: a subroutine for the exact solution of large-scale, asymmetric traveling salesman problems (1995) (24)
A Freight Service Design Problem for a Railway Corridor (2011) (23)
New lower bounds for the Symmetric Travelling Salesman Problem (1989) (23)
Solving Real-World ATSP Instances by Branch-and-Cut (2001) (23)
A matheuristic for the two-stage fixed-charge transportation problem (2018) (23)
Algorithm for the solution of the Bottleneck Assignment Problem (1981) (22)
Finding a minimum equivalent graph of a digraph (1982) (22)
Robust Train Routing and Online Re-scheduling (2010) (21)
Exact approaches for solving robust prize-collecting Steiner tree problems (2013) (20)
An Algorithm for the Bottleneck Traveling Salesman Problem (1984) (20)
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010. Proceedings (2010) (20)
Experiments with a multi-commodity formulation for the Symmetric Capacitated Vehicle Routing Problem (1995) (19)
Approximation schemes for the subset-sum problem: Survey and experimental analysis (1985) (19)
On exact solutions for the Minmax Regret Spanning Tree problem (2014) (18)
An exact algorithm for the capacitated shortest spanning arborescence (1995) (17)
A Railway Timetable Rescheduling Approach for Handling Large Scale Disruptions (2014) (17)
A multistart heuristic for the equality generalized traveling salesman problem (2011) (16)
The Recoverable Robust Two-Level Network Design Problem (2015) (16)
Models and Algorithms for the Train Unit Assignment Problem (2012) (16)
An exact algorithm for the subset sum problem (2002) (15)
A Branch-and-Cut Algorithm for the Symmetric Generalized Travelling Salesman Problem (1995) (15)
Optimization of a pipe-line for the natural gas transportation (1982) (15)
Exact Solution of the Capacitated Vehicle Routing Problem (2011) (14)
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times (2020) (14)
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting (2014) (14)
A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems (1995) (14)
Optimal and canonical solutions of the change making problem (1980) (14)
Delay-Robust Event Scheduling (2014) (13)
Robust Train Timetabling (2018) (13)
On integer polytopes with few nonzero vertices (2013) (13)
04. Solution of the Train Platforming Problem (2007) (12)
Algorithm 37 Algorithm for the solution of the 0–1 single knapsack problem (1978) (11)
Recovery-Robust Platforming by Network Buffering (2009) (11)
Finding cliques of maximum weight on a generalization of permutation graphs (2013) (11)
On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems (1998) (10)
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems (2009) (10)
A Fast Heuristic Algorithm for the Train Unit Assignment Problem (2012) (9)
An Effective Peak Period Heuristic for Railway Rolling Stock Planning (2019) (9)
Integrated Decision Support Tools for Disruption Management (2015) (7)
Algorithm for the solution of the assignment problem for sparse matrices (1983) (7)
Dynamic Loading and Unloading of Liquids into Tanks (1980) (7)
A note on exact algorithms for the bottleneck generalized assignment problem (1995) (7)
An Overview of Recovery Models for Real-time Railway Rescheduling (2013) (5)
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (2020) (5)
An Iterated Local Search Algorithm for the Pollution Traveling Salesman Problem (2018) (5)
Optimizing the Design of Water Distribution Networks Using Mathematical Optimization (2015) (5)
Guest editorial to the Special Issue "Routing and Logistics" (VeRoLog 2012) (2014) (5)
A multi-tiered vehicle routing problem with global cross-docking (2022) (4)
A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection (2020) (4)
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (2021) (3)
Route 2005: Recent advances in vehicle routing optimization (2007) (3)
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization (2010) (3)
A Tutorial on Train Timetabling and Train Platforming Problems (2013) (3)
Algorithms and Models For Combinatorial Optimization Problems (2010) (3)
Exact solutions for the robust prize-collecting steiner tree problem (2011) (3)
The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic (2021) (3)
Infeasible path formulations for the time-dependent TSP with time windows (2011) (3)
Rejoinder on: an overview of curriculum-based course timetabling (2015) (2)
An Integer Linear Programming based heuristic approach for the capacitated m-ring-star problem (2011) (2)
A Heuristic Algorithm for Set Covering Problems (1995) (2)
A gap in scientific reporting (2021) (2)
Optimal loading and unloading operations at an oil terminal. Technical report (1976) (2)
Statistical Analysis of Some Traveling Salesman Algorithms. (1984) (2)
A metaheuristic framework for Nonlinear Capacitated Covering Problems (2016) (2)
A Note on 0.5-Bounded Greedy Algorithms for the 0/1 Knapsack Problem (1992) (2)
Timetable Optimization for High-Speed Trains at Chinese Railways (2016) (2)
A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem (2008) (2)
Referee Assignment Problem Case: Italian Volleyball Championships (2012) (2)
Comments on: Routing problems with loading constraints (2010) (1)
Abstracts for the 2000 Transportation Science Section Dissertation Prize Competition (2001) (1)
Tabu Search for the Graph Coloring Problem (2010) (1)
Technical Note - A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems (1980) (1)
Characteristics of the plasmasphere at middle latitudes (1975) (1)
New trends in exact algorithmsfor the 0-1 knapsack (2006) (1)
A macroscopic railway timetable rescheduling approach for handling large scale disruptions (2013) (1)
An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs (2020) (1)
Egon Balas (1922-2019) (2019) (1)
An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines (1992) (1)
A Heuristic Algorithm for Very-Large Scale Set Covering Problems (1996) (1)
Alberto Caprara (1968-2012): Scientific Contributions (2013) (0)
A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem (2014) (0)
Preface (2018) (0)
Tabu Search for the Graph Coloring Problem ( extended ) (2010) (0)
Book reviewComputer scheduling of public transport: Urban passenger vehicle and crew scheduling: Anthony WREN (Ed.) North-Holland, Amsterdam, 1981, viii + 359 pages, Dfl. 120.00 (1982) (0)
A Service Design Problem for a Railway Network (2009) (0)
A Heuristica Algorithm for a Crew Rostring Problem Arising in Railway Applications. (1995) (0)
Discrete Applied Mathematics, Mathematical Software Section (2010) (0)
A gap in scientific reporting (2021) (0)
Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2005) (0)
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem (2022) (0)
The Cost Constraint Minimum Spanning Tree and the label constrained minimum spanning tree problems (2009) (0)
Improved rolling horizon approaches to the aircraft sequencing problem (2015) (0)
A Heuristic Algorithm for the Train-Unit Assignment Problem (2010) (0)
Erratum to Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem (1981) (0)
Final Report, Project PARTNER (Path Allocation Re-engineering of Timetable Network for European Railway) (2006) (0)
Algorithms for routing and transit problems (1996) (0)
Automatic digital magnetic recording system in Tihany Observatory (1978) (0)
State-of-the-Art and User Needs in Capacity Management and Access Charging (Project Report of the PARTNER project) (2004) (0)
Rejoinder on: an overview of curriculum-based course timetabling (2015) (0)
Effective metaheuristics for the latency location routing problem (2023) (0)
A solution procedure for the Generalized Covering Salesman Problem (2010) (0)
Operating Systems with Characteristics of Portability for Minicomputers (1974) (0)
Parallel shortest augmenting path algorithm for the assignment problem. Technical report (1989) (0)
A metaheuristic approach for the unicost set covering problem (2009) (0)
An ILP Local Search Algorithm for the Capacitated m-Ring-Star Problem (2011) (0)
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems (2013) (0)
Recoverable Robustness for Scheduling with Precedence Constraints (2009) (0)
Instances for the Recoverable Robust Two-Level Network Design Problem (2014) (0)
On the optimal design of water distribution networks: a practical MINLP approach (2011) (0)
Guest Editorial to the Feature Cluster "New Trends in Applied Combinatorial Optimization" (EURO/ALIO 2018) (2021) (0)
International Journal of Innovative Technology and Exploring Engineering (IJITEE) (2019) (0)
A Local Search procedure for the Open vehicle Routing Problem (2008) (0)
Operational Research: Methods and Applications (2023) (0)
A metaheuristic framework for Nonlinear Capacitated Covering Problems (2015) (0)
A heuristic Method to solve the Capacitated m-Ring-Star Problem (2009) (0)
A Variable Neighborhood Search and its Application to a Ring Star Problem (2017) (0)
INTERNATIONAL SCHOOL OF MATHEMATICS «GUIDO STAMPACCHIA» 56th Workshop: GRAPH THEORY, ALGORITHMS AND APPLICATIONS (2008) (0)
An Electro magnetism based Metaheuristic for the unicost Set Covering Problem (2008) (0)
Modeling and Solving theTrain (2007) (0)
Finding cliques of maximum weight on a generalization of permutation graphs (2011) (0)
ILP-based improvement procedure for solving two variants of the standard vehicle routing problem (2014) (0)
CREW SCHEDULING AND ROSTERING PROBLEMS IN RAILWAY APPLICATIONS (1998) (0)
An overview of curriculum-based course timetabling (2015) (0)
Heuristic Procedures for the Generalized Covering Salesman Problem (2009) (0)

This paper list is powered by the following services:

Other Resources About Paolo Toth

en.wikipedia.org

What Schools Are Affiliated With Paolo Toth?

Paolo Toth is affiliated with the following schools:

Paolo Toth's Academic­Influence.com Rankings

Why Is Paolo Toth Influential?

Paolo Toth's Published Works

Published Works

Other Resources About Paolo Toth

What Schools Are Affiliated With Paolo Toth?

Paolo Toth's AcademicInfluence.com Rankings