Paolo Toth

156 papers A 1B 5C 10Journal 127Unranked 5
YearRankTypeTitle / Venue / Authors
2025 J jnl
A risk-averse latency location-routing problem with stochastic travel times.
Eur. J. Oper. Res.
Alan Osorio-Mora, Francisco Saldanha-da-Gama, Paolo Toth
2025 J jnl
The quadratic knapsack problem with setup.
Comput. Oper. Res.
Laura Galli, Silvano Martello, Carlos Rodrigo Rey Barra, Paolo Toth
2025 J jnl
The quadratic knapsack problem.
Eur. J. Oper. Res.
Laura Galli, Silvano Martello, Paolo Toth
2024 J jnl
Operational Research: methods and applications.
J. Oper. Res. Soc.
Fotios Petropoulos, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao
2023 J jnl
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems.
Int. Trans. Oper. Res.
Valentina Cacchiani, Carlos Contreras Bolton, Luis Miguel Escobar-Falcón, Paolo Toth
2023 J jnl
An iterated local search algorithm for latency vehicle routing problems with multiple depots.
Comput. Oper. Res.
Alan Osorio-Mora, John Willmer Escobar, Paolo Toth
2023 J jnl
Effective metaheuristics for the latency location routing problem.
Int. Trans. Oper. Res.
Alan Osorio-Mora, Carlos Rey, Paolo Toth, Daniele Vigo
2023 J jnl
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem.
Discret. Appl. Math.
Laura Galli, Silvano Martello, Carlos Rey, Paolo Toth
2023 J jnl
The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic.
Int. Trans. Oper. Res.
Herminia I. Calvete, Carmen Galé, José A. Iranzo, Paolo Toth
2022 J jnl
A gap in scientific reporting.
4OR
Gilbert Laporte, Paolo Toth
2021 J jnl
Guest Editorial to the Feature Cluster "New Trends in Applied Combinatorial Optimization" (EURO/ALIO 2018).
Eur. J. Oper. Res.
Valentina Cacchiani, Enrico Malaguti, Paolo Toth
2021 J jnl
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem.
Eur. J. Oper. Res.
Laura Galli, Silvano Martello, Carlos Rey, Paolo Toth
2020 — conf
An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs.
SCCC
Carlos Rey, Paolo Toth, Daniele Vigo
2020 J jnl
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times.
Eur. J. Oper. Res.
Valentina Cacchiani, Carlos Contreras Bolton, Paolo Toth
2019 J jnl
An Effective Peak Period Heuristic for Railway Rolling Stock Planning.
Transp. Sci.
Valentina Cacchiani, Alberto Caprara, Paolo Toth
2019 J jnl
Egon Balas (1922-2019).
Eur. J. Oper. Res.
Immanuel M. Bomze, Paolo Toth
2018 J jnl
A matheuristic for the two-stage fixed-charge transportation problem.
Comput. Oper. Res.
Herminia I. Calvete, Carmen Galé, José A. Iranzo, Paolo Toth
2018 J jnl
Preface.
Electron. Notes Discret. Math.
Valentina Cacchiani, Enrico Malaguti, Antonio Mauttone, Paolo Toth
2016 J jnl
A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions.
Transp. Sci.
Lucas P. Veelenturf, Martin Philip Kidd, Valentina Cacchiani, Leo G. Kroon, Paolo Toth
2016 J jnl
A metaheuristic framework for Nonlinear Capacitated Covering Problems.
Optim. Lett.
Enrico Malaguti, Rosa Medina Durán, Paolo Toth
2016 J jnl
Timetable Optimization for High-Speed Trains at Chinese Railways.
Electron. Notes Discret. Math.
Valentina Cacchiani, Feng Jiang, Paolo Toth
2015 J jnl
A tutorial on non-periodic train timetabling and platforming problems.
EURO J. Transp. Logist.
Valentina Cacchiani, Laura Galli, Paolo Toth
2015 J jnl
Improved rolling horizon approaches to the aircraft sequencing problem.
J. Sched.
Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth
2015 J jnl
The Recoverable Robust Two-Level Network Design Problem.
INFORMS J. Comput.
Eduardo Álvarez-Miranda, Ivana Ljubic, S. Raghavan, Paolo Toth
2014 J jnl
A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem.
Oper. Res.
Erika Buson, Roberto Roberti, Paolo Toth
2014 J jnl
A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem.
J. Heuristics
John Willmer Escobar, Rodrigo Linfati, Paolo Toth, María G. Baldoquín
2014 — ch.
Classical Exact Algorithms for the Capacitated Vehicle Routing Problem.
Vehicle Routing
Frédéric Semet, Paolo Toth, Daniele Vigo
2014 J jnl
Delay-Robust Event Scheduling.
Oper. Res.
Alberto Caprara, Laura Galli, Sebastian Stiller, Paolo Toth
2014 J jnl
Guest editorial to the Special Issue "Routing and Logistics" (VeRoLog 2012).
Eur. J. Oper. Res.
Paolo Toth, Daniele Vigo
2014 J jnl
On exact solutions for the Minmax Regret Spanning Tree problem.
Comput. Oper. Res.
Francisco Pérez-Galarce, Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Paolo Toth
2014 C conf
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting.
ISCO
Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth
2014 — ch.
The Family of Vehicle Routing Problems.
Vehicle Routing
Stefan Irnich, Paolo Toth, Daniele Vigo
2014 — book
Vehicle Routing
Vehicle Routing
Paolo Toth, Daniele Vigo
2013 J jnl
A Lagrangian heuristic for a train-unit assignment problem.
Discret. Appl. Math.
Valentina Cacchiani, Alberto Caprara, Paolo Toth
2013 J jnl
A new lower bound for curriculum-based course timetabling.
Comput. Oper. Res.
Valentina Cacchiani, Alberto Caprara, Roberto Roberti, Paolo Toth
2013 J jnl
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems.
4OR
Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth
2013 J jnl
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem.
Comput. Oper. Res.
John Willmer Escobar, Rodrigo Linfati, Paolo Toth
2013 J jnl
An Exact Algorithm for the Multitrip Vehicle Routing Problem.
INFORMS J. Comput.
Aristide Mingozzi, Roberto Roberti, Paolo Toth
2013 J jnl
Exact approaches for solving robust prize-collecting Steiner tree problems.
Eur. J. Oper. Res.
Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth
2013 J jnl
Finding cliques of maximum weight on a generalization of permutation graphs.
Optim. Lett.
Valentina Cacchiani, Alberto Caprara, Paolo Toth
2013 J jnl
On integer polytopes with few nonzero vertices.
Oper. Res. Lett.
Valentina Cacchiani, Alberto Caprara, Gábor Maróti, Paolo Toth
2013 J jnl
Vehicle routing: historical perspective and recent contributions.
EURO J. Transp. Logist.
Gilbert Laporte, Paolo Toth, Daniele Vigo
2012 C conf
A Fast Heuristic Algorithm for the Train Unit Assignment Problem.
ATMOS
Valentina Cacchiani, Alberto Caprara, Paolo Toth
2012 J jnl
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size.
Eur. J. Oper. Res.
Fabio Furini, Enrico Malaguti, Rosa Medina Durán, Alfredo Persiani, Paolo Toth
2012 C conf
Aircraft Sequencing Problems via a Rolling Horizon Algorithm.
ISCO
Fabio Furini, Carlo Alfredo Persiani, Paolo Toth
2012 J jnl
An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem.
Eur. J. Oper. Res.
Zahra Naji-Azimi, Majid Salari, Paolo Toth
2012 C conf
Models and Algorithms for the Train Unit Assignment Problem.
ISCO
Valentina Cacchiani, Alberto Caprara, Paolo Toth
2012 J jnl
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison.
EURO J. Transp. Logist.
Roberto Roberti, Paolo Toth
2012 J jnl
Nominal and robust train timetabling problems.
Eur. J. Oper. Res.
Valentina Cacchiani, Paolo Toth
2012 J jnl
Railway Rolling Stock Planning: Robustness Against Large Disruptions.
Transp. Sci.
Valentina Cacchiani, Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti, Paolo Toth
2012 J jnl
The Generalized Covering Salesman Problem.
INFORMS J. Comput.
Bruce L. Golden, Zahra Naji-Azimi, S. Raghavan, Majid Salari, Paolo Toth
2011 J jnl
A Freight Service Design Problem for a Railway Corridor.
Transp. Sci.
Alberto Caprara, Enrico Malaguti, Paolo Toth
2011 J jnl
A multistart heuristic for the equality generalized traveling salesman problem.
Networks
Valentina Cacchiani, Albert Einstein Fernandes Muritiba, Marcos Negreiros, Paolo Toth
2011 J jnl
An exact approach for the Vertex Coloring Problem.
Discret. Optim.
Enrico Malaguti, Michele Monaci, Paolo Toth
2011 — conf
Exact solutions for the robust prize-collecting steiner tree problem.
ICUMT
Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth
2011 C conf
Infeasible path formulations for the time-dependent TSP with time windows.
CTW
Isabel Méndez-Díaz, Juan José Miranda Bront, Paolo Toth, Paula Zabala
2011 J jnl
Solution of the Train Platforming Problem.
Transp. Sci.
Alberto Caprara, Laura Galli, Paolo Toth
2010 C conf
A Heuristic Algorithm for the Train-Unit Assignment Problem.
CTW
Valentina Cacchiani, Alberto Caprara, Paolo Toth
2010 J jnl
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization.
Electron. Notes Discret. Math.
Majid Salari, Zahra Naji-Azimi, Paolo Toth
2010 J jnl
A heuristic procedure for the Capacitated m-Ring-Star problem.
Eur. J. Oper. Res.
Zahra Naji-Azimi, Majid Salari, Paolo Toth
2010 J jnl
A survey on vertex coloring problems.
Int. Trans. Oper. Res.
Enrico Malaguti, Paolo Toth
2010 J jnl
Algorithms for the Bin Packing Problem with Conflicts.
INFORMS J. Comput.
Albert Einstein Fernandes Muritiba, Manuel Iori, Enrico Malaguti, Paolo Toth
2010 J jnl
An ILP improvement procedure for the Open Vehicle Routing Problem.
Comput. Oper. Res.
Majid Salari, Paolo Toth, Andrea Tramontani
2010 J jnl
An electromagnetism metaheuristic for the unicost set covering problem.
Eur. J. Oper. Res.
Zahra Naji-Azimi, Paolo Toth, Laura Galli
2010 J jnl
Exact algorithms for routing problems under vehicle capacity constraints.
Ann. Oper. Res.
Roberto Baldacci, Paolo Toth, Daniele Vigo
2010 J jnl
Foreword.
Comput. Manag. Sci.
Paolo Toth
2010 B ed.
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
CPAIOR
Andrea Lodi, Michela Milano, Paolo Toth
2010 J jnl
Non-cyclic train timetabling and comparability graphs.
Oper. Res. Lett.
Valentina Cacchiani, Alberto Caprara, Paolo Toth
2010 C conf
Robust Train Routing and Online Re-scheduling.
ATMOS
Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti, Paolo Toth
2010 J jnl
Solving a real-world train-unit assignment problem.
Math. Program.
Valentina Cacchiani, Alberto Caprara, Paolo Toth
2010 J jnl
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems.
Comput. Oper. Res.
Zahra Naji-Azimi, Majid Salari, Bruce L. Golden, S. Raghavan, Paolo Toth
2009 J jnl
Models and heuristic algorithms for a weighted vertex coloring problem.
J. Heuristics
Enrico Malaguti, Michele Monaci, Paolo Toth
2008 J jnl
A Metaheuristic Approach for the Vertex Coloring Problem.
INFORMS J. Comput.
Enrico Malaguti, Michele Monaci, Paolo Toth
2008 C conf
A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem.
CTW
Valentina Cacchiani, Albert Einstein Fernandes Muritiba, Marcos Negreiros, Paolo Toth
2008 J jnl
A column generation approach to train timetabling on a corridor.
4OR
Valentina Cacchiani, Alberto Caprara, Paolo Toth
2008 J jnl
An evolutionary approach for bandwidth multicoloring problems.
Eur. J. Oper. Res.
Enrico Malaguti, Paolo Toth
2007 — ch.
Chapter 3 Passenger Railway Optimization.
Transportation
Alberto Caprara, Leo G. Kroon, Michele Monaci, Marc Peeters, Paolo Toth
2007 J jnl
Recent advances in vehicle routing exact algorithms.
4OR
Roberto Baldacci, Paolo Toth, Daniele Vigo
2007 J jnl
Route 2005: Recent advances in vehicle routing optimization.
Networks
Daniele Vigo, Paolo Toth, Aristide Mingozzi
2007 C conf
Solution of the Train Platforming Problem.
ATMOS
Alberto Caprara, Laura Galli, Paolo Toth
2007 C conf
Solving a Real-World Train Unit Assignment Problem.
ATMOS
Valentina Cacchiani, Alberto Caprara, Paolo Toth
2006 J jnl
A Lagrangian heuristic algorithm for a real-world train timetabling problem.
Discret. Appl. Math.
Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida
2006 J jnl
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems.
INFORMS J. Comput.
Michele Monaci, Paolo Toth
2006 J jnl
A new ILP-based refinement heuristic for Vehicle Routing Problems.
Math. Program.
Roberto De Franceschi, Matteo Fischetti, Paolo Toth
2006 A conf
An MINLP Solution Method for a Water Network Problem.
ESA
Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth
2003 J jnl
An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem.
Oper. Res.
Silvano Martello, Paolo Toth
2003 J jnl
Models and algorithms for a staff scheduling problem.
Math. Program.
Alberto Caprara, Michele Monaci, Paolo Toth
2003 J jnl
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem.
INFORMS J. Comput.
Paolo Toth, Daniele Vigo
2002 — ch.
An Overview of Vehicle Routing Problems.
The Vehicle Routing Problem
Paolo Toth, Daniele Vigo
2002 J jnl
An exact algorithm for the subset sum problem.
Eur. J. Oper. Res.
Nei Yoshihiro Soma, Paolo Toth
2002 — ch.
Branch-And-Bound Algorithms for the Capacitated VRP.
The Vehicle Routing Problem
Paolo Toth, Daniele Vigo
2002 J jnl
Modeling and Solving the Train Timetabling Problem.
Oper. Res.
Alberto Caprara, Matteo Fischetti, Paolo Toth
2002 J jnl
Models, relaxations and exact approaches for the capacitated vehicle routing problem.
Discret. Appl. Math.
Paolo Toth, Daniele Vigo
2002 — book
The Vehicle Routing Problem.
Paolo Toth, Daniele Vigo
2002 — ch.
VRP with Backhauls.
The Vehicle Routing Problem
Paolo Toth, Daniele Vigo
2001 J jnl
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems.
Manag. Sci.
Matteo Fischetti, Andrea Lodi, Silvano Martello, Paolo Toth
2001 J jnl
Abstracts for the 2000 Transportation Science Section Dissertation Prize Competition.
Transp. Sci.
Paolo Toth, Hillel Bar-Gera, Diego Klabjan, Roberto Baldacci, Cenk Çaliskan, Christina Diakaki, Lasse Fridström, Vijay S. Nori
2001 J jnl
Lower bounds and algorithms for the 2-dimensional vector packing problem.
Discret. Appl. Math.
Alberto Caprara, Paolo Toth
2001 — conf
Solution of Real-World Train Timetabling Problems.
HICSS
Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth
2001 — conf
Solving Real-World ATSP Instances by Branch-and-Cut.
Combinatorial Optimization
Matteo Fischetti, Andrea Lodi, Paolo Toth
2000 J jnl
Algorithms and codes for dense assignment problems: the state of the art.
Discret. Appl. Math.
Mauro Dell'Amico, Paolo Toth
2000 J jnl
Algorithms for the Set Covering Problem.
Ann. Oper. Res.
Alberto Caprara, Paolo Toth, Matteo Fischetti
2000 J jnl
New trends in exact algorithms for the 0-1 knapsack problem.
Eur. J. Oper. Res.
Silvano Martello, David Pisinger, Paolo Toth
2000 J jnl
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems.
Eur. J. Oper. Res.
Paolo Toth
1999 J jnl
A Heuristic Method for the Set Covering Problem.
Oper. Res.
Alberto Caprara, Matteo Fischetti, Paolo Toth
1999 J jnl
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls.
Eur. J. Oper. Res.
Paolo Toth, Daniele Vigo
1999 J jnl
Exact Solution of the Quadratic Knapsack Problem.
INFORMS J. Comput.
Alberto Caprara, David Pisinger, Paolo Toth
1998 J jnl
A Survey of Optimization Models for Train Routing and Scheduling.
Transp. Sci.
Jean-François Cordeau, Paolo Toth, Daniele Vigo
1998 J jnl
Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem.
Softw. Pract. Exp.
Alberto Caprara, Filippo Focacci, Evelina Lamma, Paola Mello, Michela Milano, Paolo Toth, Daniele Vigo
1998 J jnl
Modeling and Solving the Crew Rostering Problem.
Oper. Res.
Alberto Caprara, Paolo Toth, Daniele Vigo, Matteo Fischetti
1998 J jnl
On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems.
Ann. Oper. Res.
Laureano F. Escudero, Silvano Martello, Paolo Toth
1998 J jnl
Solving the Orienteering Problem through Branch-and-Cut.
INFORMS J. Comput.
Matteo Fischetti, Juan José Salazar González, Paolo Toth
1997 J jnl
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem.
Oper. Res.
Matteo Fischetti, Juan José Salazar González, Paolo Toth
1997 J jnl
Algorithms for railway crew management.
Math. Program.
Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida
1997 J jnl
An Exact Algorithm for the Vehicle Routing Problem with Backhauls.
Transp. Sci.
Paolo Toth, Daniele Vigo
1997 J jnl
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines.
Discret. Appl. Math.
Silvano Martello, François Soumis, Paolo Toth
1997 J jnl
Heuristic Algorithms for the Handicapped Persons Transportation Problem.
Transp. Sci.
Paolo Toth, Daniele Vigo
1997 J jnl
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems.
Oper. Res.
Silvano Martello, Paolo Toth
1996 B conf
A Heuristic Algorithm for the Set Covering Problem.
IPCO
Alberto Caprara, Matteo Fischetti, Paolo Toth
1995 B conf
A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems.
IPCO
Laureano F. Escudero, Silvano Martello, Paolo Toth
1995 J jnl
Algorithm 750: CDT: A Subroutine for the Exact Solution of Large-Scale Asymmetric Travelling Salesman Problems.
ACM Trans. Math. Softw.
Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth
1995 J jnl
An exact algorithm for the capacitated shortest spanning arborescence.
Ann. Oper. Res.
Paolo Toth, Daniele Vigo
1995 J jnl
Exact Solution of Large Scale Asymmetric Travelling Salesman Problems.
ACM Trans. Math. Softw.
Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth
1995 J jnl
The symmetric generalized traveling salesman polytope.
Networks
Matteo Fischetti, Juan José Salazar González, Paolo Toth
1994 J jnl
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs.
Oper. Res.
Matteo Fischetti, Paolo Toth, Daniele Vigo
1993 J jnl
An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs.
INFORMS J. Comput.
Matteo Fischetti, Paolo Toth
1992 J jnl
A Note on 0.5-Bounded Greedy Algorithms for the 0/1 Knapsack Problem.
Inf. Process. Lett.
Silvano Martello, Paolo Toth
1992 B conf
An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines.
IPCO
Silvano Martello, François Soumis, Paolo Toth
1992 J jnl
An additive bounding procedure for the asymmetric travelling salesman problem.
Math. Program.
Matteo Fischetti, Paolo Toth
1992 J jnl
Approximation Algorithms for Fixed Job Schedule Problems.
Oper. Res.
Matteo Fischetti, Silvano Martello, Paolo Toth
1992 B conf
Generalized Assignment Problems.
ISAAC
Silvano Martello, Paolo Toth
1991 J jnl
A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem.
J. ACM
Egon Balas, Donald L. Miller, Joseph F. Pekny, Paolo Toth
1990 J jnl
Lower bounds and reduction procedures for the bin packing problem.
Discret. Appl. Math.
Silvano Martello, Paolo Toth
1989 J jnl
A branch and bound algorithm for the multiple depot vehicle scheduling problem.
Networks
Giorgio Carpaneto, Mauro Dell'Amico, Matteo Fischetti, Paolo Toth
1989 J jnl
An Additive Bounding Procedure for Combinatorial Optimization Problems.
Oper. Res.
Matteo Fischetti, Paolo Toth
1989 J jnl
New lower bounds for the Symmetric Travelling Salesman Problem.
Math. Program.
Giorgio Carpaneto, Matteo Fischetti, Paolo Toth
1989 J jnl
The Fixed Job Schedule Problem with Working-Time Constraints.
Oper. Res.
Matteo Fischetti, Silvano Martello, Paolo Toth
1987 J jnl
Primal-dual algrorithms for the assignment problem.
Discret. Appl. Math.
Giorgio Carpaneto, Paolo Toth
1987 J jnl
The Fixed Job Schedule Problem with Spread-Time Constraints.
Oper. Res.
Matteo Fischetti, Silvano Martello, Paolo Toth
1986 J jnl
Most and least uniform spanning trees.
Discret. Appl. Math.
Paolo M. Camerini, Francesco Maffioli, Silvano Martello, Paolo Toth
1985 J jnl
Algorithm 632: A Program for the 0-1 Multiple Knapsack Problem.
ACM Trans. Math. Softw.
Silvano Martello, Paolo Toth
1984 J jnl
An Algorithm for the Bottleneck Traveling Salesman Problem.
Oper. Res.
Giorgio Carpaneto, Silvano Martello, Paolo Toth
1984 J jnl
Worst-case analysis of greedy algorithms for the subset-sum problem.
Math. Program.
Silvano Martello, Paolo Toth
1983 J jnl
Algorithm for the solution of the assignment problem for sparse matrices.
Computing
Giorgio Carpaneto, Paolo Toth
1982 J jnl
Finding a minimum equivalent graph of a digraph.
Networks
Silvano Martello, Paolo Toth
1981 J jnl
A Bound and Bound algorithm for the zero-one multiple knapsack problem.
Discret. Appl. Math.
Silvano Martello, Paolo Toth
1981 J jnl
Algorithm for the solution of the Bottleneck Assignment Problem.
Computing
Giorgio Carpaneto, Paolo Toth
1981 J jnl
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations.
Math. Program.
Nicos Christofides, Aristide Mingozzi, Paolo Toth
1981 J jnl
Heuristic algorithms for the multiple knapsack problem.
Computing
Silvano Martello, Paolo Toth
1981 J jnl
State-space relaxation procedures for the computation of bounds to routing problems.
Networks
Nicos Christofides, Aristide Mingozzi, Paolo Toth
1980 J jnl
Algorithm 548: Solution of the Assignment Problem [H].
ACM Trans. Math. Softw.
Giorgio Carpaneto, Paolo Toth
1980 J jnl
Dynamic Loading and Unloading of Liquids into Tanks.
Oper. Res.
Nicos Christofides, Aristide Mingozzi, Paolo Toth
1980 J jnl
Dynamic programming algorithms for the Zero-One Knapsack Problem.
Computing
Paolo Toth
1980 J jnl
Technical Note - A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems.
Oper. Res.
Silvano Martello, Paolo Toth
1978 J jnl
Algorithm 37 Algorithm for the solution of the 0-1 single knapsack problem.
Computing
Silvano Martello, Paolo Toth
1974 — conf
Operating Systems with Characteristics of Portability for Minicomputers.
GI Jahrestagung
R. Rossi, M. Spadoni, Paolo Toth