Paolo Toth
Orcid: 0000-0001-6846-5814Affiliations:
- University of Bologna, Italy
According to our database1,
Paolo Toth
authored at least 150 papers
between 1974 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
1975
1980
1985
1990
1995
2000
2005
2010
2015
2020
2025
0
5
10
15
2
1
3
2
1
5
1
2
1
2
2
3
3
5
9
6
4
11
1
3
2
3
3
3
3
4
3
5
6
4
1
1
3
1
1
4
2
1
1
2
1
1
5
4
1
1
1
3
2
2
1
1
2
1
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2025
Eur. J. Oper. Res., 2025
2024
2023
Int. Trans. Oper. Res., November, 2023
An iterated local search algorithm for latency vehicle routing problems with multiple depots.
Comput. Oper. Res., October, 2023
Discret. Appl. Math., August, 2023
The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic.
Int. Trans. Oper. Res., 2023
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems.
Int. Trans. Oper. Res., 2023
2022
2021
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem.
Eur. J. Oper. Res., 2021
Guest Editorial to the Feature Cluster "New Trends in Applied Combinatorial Optimization" (EURO/ALIO 2018).
Eur. J. Oper. Res., 2021
2020
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times.
Eur. J. Oper. Res., 2020
An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs.
Proceedings of the 39th International Conference of the Chilean Computer Science Society, 2020
2019
Transp. Sci., 2019
2018
Comput. Oper. Res., 2018
2016
Transp. Sci., 2016
Optim. Lett., 2016
Electron. Notes Discret. Math., 2016
2015
J. Sched., 2015
EURO J. Transp. Logist., 2015
2014
A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem.
Oper. Res., 2014
J. Heuristics, 2014
Eur. J. Oper. Res., 2014
Comput. Oper. Res., 2014
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
Proceedings of the Vehicle Routing, 2014
2013
Optim. Lett., 2013
INFORMS J. Comput., 2013
Eur. J. Oper. Res., 2013
EURO J. Transp. Logist., 2013
Discret. Appl. Math., 2013
Comput. Oper. Res., 2013
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems.
4OR, 2013
2012
Transp. Sci., 2012
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size.
Eur. J. Oper. Res., 2012
An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem.
Eur. J. Oper. Res., 2012
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison.
EURO J. Transp. Logist., 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 2012
2011
Networks, 2011
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
2010
Eur. J. Oper. Res., 2010
Eur. J. Oper. Res., 2010
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization.
Electron. Notes Discret. Math., 2010
Comput. Oper. Res., 2010
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems.
Comput. Oper. Res., 2010
Ann. Oper. Res., 2010
A Heuristic Algorithm for the Train-Unit Assignment Problem.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
2009
J. Heuristics, 2009
2008
Eur. J. Oper. Res., 2008
A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008
2007
2006
Math. Program., 2006
INFORMS J. Comput., 2006
Discret. Appl. Math., 2006
Proceedings of the Algorithms, 2006
2003
INFORMS J. Comput., 2003
2002
Models, relaxations and exact approaches for the capacitated vehicle routing problem.
Discret. Appl. Math., 2002
Proceedings of the Vehicle Routing Problem., 2002
Proceedings of the Vehicle Routing Problem., 2002
2001
Abstracts for the 2000 Transportation Science Section Dissertation Prize Competition.
Transp. Sci., 2001
Manag. Sci., 2001
Discret. Appl. Math., 2001
Proceedings of the 34th Annual Hawaii International Conference on System Sciences (HICSS-34), 2001
Proceedings of the Combinatorial Optimization, 2001
2000
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems.
Eur. J. Oper. Res., 2000
Eur. J. Oper. Res., 2000
Discret. Appl. Math., 2000
1999
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls.
Eur. J. Oper. Res., 1999
1998
Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem.
Softw. Pract. Exp., 1998
On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems.
Ann. Oper. Res., 1998
1997
Transp. Sci., 1997
Transp. Sci., 1997
Oper. Res., 1997
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines.
Discret. Appl. Math., 1997
1996
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
1995
Algorithm 750: CDT: A Subroutine for the Exact Solution of Large-Scale Asymmetric Travelling Salesman Problems.
ACM Trans. Math. Softw., 1995
ACM Trans. Math. Softw., 1995
Ann. Oper. Res., 1995
A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
1994
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs.
Oper. Res., 1994
1993
INFORMS J. Comput., 1993
1992
Math. Program., 1992
Inf. Process. Lett., 1992
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992
1991
J. ACM, 1991
1990
Discret. Appl. Math., 1990
1989
Networks, 1989
Oper. Res., 1989
1987
1986
1985
ACM Trans. Math. Softw., 1985
1984
Math. Program., 1984
1983
Computing, 1983
1982
1981
Networks, 1981
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations.
Math. Program., 1981
Discret. Appl. Math., 1981
1980
Technical Note - A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems.
Oper. Res., 1980
1978
Computing, 1978
1974
Proceedings of the GI - 4. Jahrestagung, Berlin, 9.-12. Oktober 1974, 1974