Operating Systems with Characteristics of Portability for Minicomputers. - R. Rossi; M. Spadoni; Paolo Toth (GI Jahrestagung, 1974)

Algorithm 37 Algorithm for the solution of the 0-1 single knapsack problem. - Silvano Martello; Paolo Toth (Computing, 1978)

Dynamic programming algorithms for the Zero-One Knapsack Problem. - Paolo Toth (Computing, 1980)

Dynamic Loading and Unloading of Liquids into Tanks. - Nicos Christofides; Aristide Mingozzi; Paolo Toth (Oper. Res., 1980)

Technical Note - A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems. - Silvano Martello; Paolo Toth (Oper. Res., 1980)

Algorithm 548: Solution of the Assignment Problem [H]. - Giorgio Carpaneto; Paolo Toth (ACM Trans. Math. Softw., 1980)

Algorithm for the solution of the Bottleneck Assignment Problem. - Giorgio Carpaneto; Paolo Toth (Computing, 1981)

Heuristic algorithms for the multiple knapsack problem. - Silvano Martello; Paolo Toth (Computing, 1981)

A Bound and Bound algorithm for the zero-one multiple knapsack problem. - Silvano Martello; Paolo Toth (Discret. Appl. Math., 1981)

Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. - Nicos Christofides; Aristide Mingozzi; Paolo Toth (Math. Program., 1981)

State-space relaxation procedures for the computation of bounds to routing problems. - Nicos Christofides; Aristide Mingozzi; Paolo Toth (Networks, 1981)

Finding a minimum equivalent graph of a digraph. - Silvano Martello; Paolo Toth (Networks, 1982)

Algorithm for the solution of the assignment problem for sparse matrices. - Giorgio Carpaneto; Paolo Toth (Computing, 1983)

An Algorithm for the Bottleneck Traveling Salesman Problem. - Giorgio Carpaneto; Silvano Martello; Paolo Toth (Oper. Res., 1984)

Worst-case analysis of greedy algorithms for the subset-sum problem. - Silvano Martello; Paolo Toth (Math. Program., 1984)

Algorithm 632: A Program for the 0-1 Multiple Knapsack Problem. - Silvano Martello; Paolo Toth (ACM Trans. Math. Softw., 1985)

Most and least uniform spanning trees. - Paolo M. Camerini; Francesco Maffioli; Silvano Martello; Paolo Toth (Discret. Appl. Math., 1986)

Primal-dual algrorithms for the assignment problem. - Giorgio Carpaneto; Paolo Toth (Discret. Appl. Math., 1987)

The Fixed Job Schedule Problem with Spread-Time Constraints. - Matteo Fischetti; Silvano Martello; Paolo Toth (Oper. Res., 1987)

The Fixed Job Schedule Problem with Working-Time Constraints. - Matteo Fischetti; Silvano Martello; Paolo Toth (Oper. Res., 1989)

An Additive Bounding Procedure for Combinatorial Optimization Problems. - Matteo Fischetti; Paolo Toth (Oper. Res., 1989)

New lower bounds for the Symmetric Travelling Salesman Problem. - Giorgio Carpaneto; Matteo Fischetti; Paolo Toth (Math. Program., 1989)

A branch and bound algorithm for the multiple depot vehicle scheduling problem. - Giorgio Carpaneto; Mauro Dell'Amico; Matteo Fischetti; Paolo Toth (Networks, 1989)

Lower bounds and reduction procedures for the bin packing problem. - Silvano Martello; Paolo Toth (Discret. Appl. Math., 1990)

A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem. - Egon Balas; Donald L. Miller; Joseph F. Pekny; Paolo Toth (J. ACM, 1991)

An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines. - Silvano Martello; François Soumis; Paolo Toth (IPCO, 1992)

Generalized Assignment Problems. - Silvano Martello; Paolo Toth (ISAAC, 1992)

Approximation Algorithms for Fixed Job Schedule Problems. - Matteo Fischetti; Silvano Martello; Paolo Toth (Oper. Res., 1992)

A Note on 0.5-Bounded Greedy Algorithms for the 0/1 Knapsack Problem. - Silvano Martello; Paolo Toth (Inf. Process. Lett., 1992)

An additive bounding procedure for the asymmetric travelling salesman problem. - Matteo Fischetti; Paolo Toth (Math. Program., 1992)

An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs. - Matteo Fischetti; Paolo Toth (INFORMS J. Comput., 1993)

A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs. - Matteo Fischetti; Paolo Toth; Daniele Vigo (Oper. Res., 1994)

A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems. - Laureano F. Escudero; Silvano Martello; Paolo Toth (IPCO, 1995)

An exact algorithm for the capacitated shortest spanning arborescence. - Paolo Toth; Daniele Vigo (Ann. Oper. Res., 1995)

The symmetric generalized traveling salesman polytope. - Matteo Fischetti; Juan José Salazar González; Paolo Toth (Networks, 1995)

Exact Solution of Large Scale Asymmetric Travelling Salesman Problems. - Giorgio Carpaneto; Mauro Dell'Amico; Paolo Toth (ACM Trans. Math. Softw., 1995)

Algorithm 750: CDT: A Subroutine for the Exact Solution of Large-Scale Asymmetric Travelling Salesman Problems. - Giorgio Carpaneto; Mauro Dell'Amico; Paolo Toth (ACM Trans. Math. Softw., 1995)

A Heuristic Algorithm for the Set Covering Problem. - Alberto Caprara; Matteo Fischetti; Paolo Toth (IPCO, 1996)

Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines. - Silvano Martello; François Soumis; Paolo Toth (Discret. Appl. Math., 1997)

A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem. - Matteo Fischetti; Juan José Salazar González; Paolo Toth (Oper. Res., 1997)

Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems. - Silvano Martello; Paolo Toth (Oper. Res., 1997)

Algorithms for railway crew management. - Alberto Caprara; Matteo Fischetti; Paolo Toth; Daniele Vigo; Pier Luigi Guida (Math. Program., 1997)

Heuristic Algorithms for the Handicapped Persons Transportation Problem. - Paolo Toth; Daniele Vigo (Transp. Sci., 1997)

An Exact Algorithm for the Vehicle Routing Problem with Backhauls. - Paolo Toth; Daniele Vigo (Transp. Sci., 1997)

On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems. - Laureano F. Escudero; Silvano Martello; Paolo Toth (Ann. Oper. Res., 1998)

Solving the Orienteering Problem through Branch-and-Cut. - Matteo Fischetti; Juan José Salazar González; Paolo Toth (INFORMS J. Comput., 1998)

Modeling and Solving the Crew Rostering Problem. - Alberto Caprara; Paolo Toth; Daniele Vigo; Matteo Fischetti (Oper. Res., 1998)

Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem. - Alberto Caprara; Filippo Focacci; Evelina Lamma; Paola Mello; Michela Milano; Paolo Toth; Daniele Vigo (Softw. Pract. Exp., 1998)

A Survey of Optimization Models for Train Routing and Scheduling. - Jean-François Cordeau; Paolo Toth; Daniele Vigo (Transp. Sci., 1998)

A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. - Paolo Toth; Daniele Vigo (Eur. J. Oper. Res., 1999)

Exact Solution of the Quadratic Knapsack Problem. - Alberto Caprara; David Pisinger; Paolo Toth (INFORMS J. Comput., 1999)

A Heuristic Method for the Set Covering Problem. - Alberto Caprara; Matteo Fischetti; Paolo Toth (Oper. Res., 1999)

Algorithms for the Set Covering Problem. - Alberto Caprara; Paolo Toth; Matteo Fischetti (Ann. Oper. Res., 2000)

Algorithms and codes for dense assignment problems: the state of the art. - Mauro Dell'Amico; Paolo Toth (Discret. Appl. Math., 2000)

New trends in exact algorithms for the 0-1 knapsack problem. - Silvano Martello; David Pisinger; Paolo Toth (Eur. J. Oper. Res., 2000)

Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems. - Paolo Toth (Eur. J. Oper. Res., 2000)

Solving Real-World ATSP Instances by Branch-and-Cut. - Matteo Fischetti; Andrea Lodi 001; Paolo Toth (Combinatorial Optimization, 2001)

Solution of Real-World Train Timetabling Problems. - Alberto Caprara; Matteo Fischetti; Pier Luigi Guida; Michele Monaci; Giuseppe Sacco; Paolo Toth (HICSS, 2001)

Lower bounds and algorithms for the 2-dimensional vector packing problem. - Alberto Caprara; Paolo Toth (Discret. Appl. Math., 2001)

A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems. - Matteo Fischetti; Andrea Lodi 001; Silvano Martello; Paolo Toth (Manag. Sci., 2001)

Abstracts for the 2000 Transportation Science Section Dissertation Prize Competition. - Paolo Toth; Hillel Bar-Gera; Diego Klabjan; Roberto Baldacci; Cenk Çaliskan; Christina Diakaki; Lasse Fridström; Vijay S. Nori (Transp. Sci., 2001)

An Overview of Vehicle Routing Problems. - Paolo Toth; Daniele Vigo (The Vehicle Routing Problem, 2002)

Branch-And-Bound Algorithms for the Capacitated VRP. - Paolo Toth; Daniele Vigo (The Vehicle Routing Problem, 2002)

VRP with Backhauls. - Paolo Toth; Daniele Vigo (The Vehicle Routing Problem, 2002)

Models, relaxations and exact approaches for the capacitated vehicle routing problem. - Paolo Toth; Daniele Vigo (Discret. Appl. Math., 2002)

An exact algorithm for the subset sum problem. - Nei Yoshihiro Soma; Paolo Toth (Eur. J. Oper. Res., 2002)

Modeling and Solving the Train Timetabling Problem. - Alberto Caprara; Matteo Fischetti; Paolo Toth (Oper. Res., 2002)

The Granular Tabu Search and Its Application to the Vehicle-Routing Problem. - Paolo Toth; Daniele Vigo (INFORMS J. Comput., 2003)

An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem. - Silvano Martello; Paolo Toth (Oper. Res., 2003)

Models and algorithms for a staff scheduling problem. - Alberto Caprara; Michele Monaci; Paolo Toth (Math. Program., 2003)

An MINLP Solution Method for a Water Network Problem. - Cristiana Bragalli; Claudia D'Ambrosio; Jon Lee 001; Andrea Lodi 001; Paolo Toth (ESA, 2006)

A Lagrangian heuristic algorithm for a real-world train timetabling problem. - Alberto Caprara; Michele Monaci; Paolo Toth; Pier Luigi Guida (Discret. Appl. Math., 2006)

A Set-Covering-Based Heuristic Approach for Bin-Packing Problems. - Michele Monaci; Paolo Toth (INFORMS J. Comput., 2006)

A new ILP-based refinement heuristic for Vehicle Routing Problems. - Roberto De Franceschi; Matteo Fischetti; Paolo Toth (Math. Program., 2006)

Chapter 3 Passenger Railway Optimization. - Alberto Caprara; Leo G. Kroon; Michele Monaci; Marc Peeters; Paolo Toth (Transportation, 2007)

Recent advances in vehicle routing exact algorithms. - Roberto Baldacci; Paolo Toth; Daniele Vigo (4OR, 2007)

Route 2005: Recent advances in vehicle routing optimization. - Daniele Vigo; Paolo Toth; Aristide Mingozzi (Networks, 2007)

A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem. - Valentina Cacchiani; Albert Einstein Fernandes Muritiba; Marcos Negreiros; Paolo Toth (CTW, 2008)

A column generation approach to train timetabling on a corridor. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (4OR, 2008)

An evolutionary approach for bandwidth multicoloring problems. - Enrico Malaguti; Paolo Toth (Eur. J. Oper. Res., 2008)

A Metaheuristic Approach for the Vertex Coloring Problem. - Enrico Malaguti; Michele Monaci; Paolo Toth (INFORMS J. Comput., 2008)

Models and heuristic algorithms for a weighted vertex coloring problem. - Enrico Malaguti; Michele Monaci; Paolo Toth (J. Heuristics, 2009)

Robust Train Routing and Online Re-scheduling. - Alberto Caprara; Laura Galli; Leo G. Kroon; Gábor Maróti; Paolo Toth (ATMOS, 2010)

A Heuristic Algorithm for the Train-Unit Assignment Problem. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (CTW, 2010)

Exact algorithms for routing problems under vehicle capacity constraints. - Roberto Baldacci; Paolo Toth; Daniele Vigo (Ann. Oper. Res., 2010)

Foreword. - Paolo Toth (Comput. Manag. Sci., 2010)

Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems. - Zahra Naji Azimi; Majid Salari; Bruce L. Golden; S. Raghavan 001; Paolo Toth (Comput. Oper. Res., 2010)

An ILP improvement procedure for the Open Vehicle Routing Problem. - Majid Salari; Paolo Toth; Andrea Tramontani (Comput. Oper. Res., 2010)

A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization. - Majid Salari; Zahra Naji Azimi; Paolo Toth (Electron. Notes Discret. Math., 2010)

A heuristic procedure for the Capacitated m-Ring-Star problem. - Zahra Naji Azimi; Majid Salari; Paolo Toth (Eur. J. Oper. Res., 2010)

An electromagnetism metaheuristic for the unicost set covering problem. - Zahra Naji Azimi; Paolo Toth; Laura Galli (Eur. J. Oper. Res., 2010)

Algorithms for the Bin Packing Problem with Conflicts. - Albert Einstein Fernandes Muritiba; Manuel Iori; Enrico Malaguti; Paolo Toth (INFORMS J. Comput., 2010)

A survey on vertex coloring problems. - Enrico Malaguti; Paolo Toth (Int. Trans. Oper. Res., 2010)

Solving a real-world train-unit assignment problem. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (Math. Program., 2010)

Non-cyclic train timetabling and comparability graphs. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (Oper. Res. Lett., 2010)

Infeasible path formulations for the time-dependent TSP with time windows. - Isabel Méndez-Díaz; Juan José Miranda Bront; Paolo Toth; Paula Zabala (CTW, 2011)

Exact solutions for the robust prize-collecting steiner tree problem. - Eduardo Álvarez-Miranda; Ivana Ljubic; Paolo Toth (ICUMT, 2011)

An exact approach for the Vertex Coloring Problem. - Enrico Malaguti; Michele Monaci; Paolo Toth (Discret. Optim., 2011)

A multistart heuristic for the equality generalized traveling salesman problem. - Valentina Cacchiani; Albert Einstein Fernandes Muritiba; Marcos Negreiros; Paolo Toth (Networks, 2011)

Solution of the Train Platforming Problem. - Alberto Caprara; Laura Galli; Paolo Toth (Transp. Sci., 2011)

A Freight Service Design Problem for a Railway Corridor. - Alberto Caprara; Enrico Malaguti; Paolo Toth (Transp. Sci., 2011)

A Fast Heuristic Algorithm for the Train Unit Assignment Problem. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (ATMOS, 2012)

Models and Algorithms for the Train Unit Assignment Problem. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (ISCO, 2012)

Aircraft Sequencing Problems via a Rolling Horizon Algorithm. - Fabio Furini; Carlo Alfredo Persiani; Paolo Toth (ISCO, 2012)

Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison. - Roberto Roberti; Paolo Toth (EURO J. Transp. Logist., 2012)

An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem. - Zahra Naji Azimi; Majid Salari; Paolo Toth (Eur. J. Oper. Res., 2012)

Nominal and robust train timetabling problems. - Valentina Cacchiani; Paolo Toth (Eur. J. Oper. Res., 2012)

A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. - Fabio Furini; Enrico Malaguti; Rosa Medina Durán; Alfredo Persiani; Paolo Toth (Eur. J. Oper. Res., 2012)

The Generalized Covering Salesman Problem. - Bruce L. Golden; Zahra Naji Azimi; S. Raghavan 001; Majid Salari; Paolo Toth (INFORMS J. Comput., 2012)

Railway Rolling Stock Planning: Robustness Against Large Disruptions. - Valentina Cacchiani; Alberto Caprara; Laura Galli; Leo G. Kroon; Gábor Maróti; Paolo Toth (Transp. Sci., 2012)

A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. - Eduardo Álvarez-Miranda; Ivana Ljubic; Paolo Toth (4OR, 2013)

A new lower bound for curriculum-based course timetabling. - Valentina Cacchiani; Alberto Caprara; Roberto Roberti; Paolo Toth (Comput. Oper. Res., 2013)

A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. - John Willmer Escobar; Rodrigo Linfati; Paolo Toth (Comput. Oper. Res., 2013)

A Lagrangian heuristic for a train-unit assignment problem. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (Discret. Appl. Math., 2013)

Vehicle routing: historical perspective and recent contributions. - Gilbert Laporte; Paolo Toth; Daniele Vigo (EURO J. Transp. Logist., 2013)

Exact approaches for solving robust prize-collecting Steiner tree problems. - Eduardo Álvarez-Miranda; Ivana Ljubic; Paolo Toth (Eur. J. Oper. Res., 2013)

An Exact Algorithm for the Multitrip Vehicle Routing Problem. - Aristide Mingozzi; Roberto Roberti; Paolo Toth (INFORMS J. Comput., 2013)

Finding cliques of maximum weight on a generalization of permutation graphs. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (Optim. Lett., 2013)

On integer polytopes with few nonzero vertices. - Valentina Cacchiani; Alberto Caprara; Gábor Maróti; Paolo Toth (Oper. Res. Lett., 2013)

The Family of Vehicle Routing Problems. - Stefan Irnich; Paolo Toth; Daniele Vigo (Vehicle Routing, 2014)

Classical Exact Algorithms for the Capacitated Vehicle Routing Problem. - Frédéric Semet; Paolo Toth; Daniele Vigo (Vehicle Routing, 2014)

State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting. - Fabio Furini; Martin Philip Kidd; Carlo Alfredo Persiani; Paolo Toth (ISCO, 2014)

On exact solutions for the Minmax Regret Spanning Tree problem. - Francisco Pérez-Galarce; Eduardo Álvarez-Miranda; Alfredo Candia-Véjar; Paolo Toth (Comput. Oper. Res., 2014)

Guest editorial to the Special Issue "Routing and Logistics" (VeRoLog 2012). - Paolo Toth; Daniele Vigo (Eur. J. Oper. Res., 2014)

A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem. - John Willmer Escobar; Rodrigo Linfati; Paolo Toth; María G. Baldoquín (J. Heuristics, 2014)

A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem. - Erika Buson; Roberto Roberti; Paolo Toth (Oper. Res., 2014)

Delay-Robust Event Scheduling. - Alberto Caprara; Laura Galli; Sebastian Stiller; Paolo Toth (Oper. Res., 2014)

A tutorial on non-periodic train timetabling and platforming problems. - Valentina Cacchiani; Laura Galli; Paolo Toth (EURO J. Transp. Logist., 2015)

The Recoverable Robust Two-Level Network Design Problem. - Eduardo Álvarez-Miranda; Ivana Ljubic; S. Raghavan 001; Paolo Toth (INFORMS J. Comput., 2015)

Improved rolling horizon approaches to the aircraft sequencing problem. - Fabio Furini; Martin Philip Kidd; Carlo Alfredo Persiani; Paolo Toth (J. Sched., 2015)

Timetable Optimization for High-Speed Trains at Chinese Railways. - Valentina Cacchiani; Feng Jiang 004; Paolo Toth (Electron. Notes Discret. Math., 2016)

A metaheuristic framework for Nonlinear Capacitated Covering Problems. - Enrico Malaguti; Rosa Medina Durán; Paolo Toth (Optim. Lett., 2016)

A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions. - Lucas P. Veelenturf; Martin Philip Kidd; Valentina Cacchiani; Leo G. Kroon; Paolo Toth (Transp. Sci., 2016)

A matheuristic for the two-stage fixed-charge transportation problem. - Herminia I. Calvete; Carmen Galé; José A. Iranzo; Paolo Toth (Comput. Oper. Res., 2018)

Preface. - Valentina Cacchiani; Enrico Malaguti; Antonio Mauttone; Paolo Toth (Electron. Notes Discret. Math., 2018)

Egon Balas (1922-2019). - Immanuel M. Bomze; Paolo Toth (Eur. J. Oper. Res., 2019)

An Effective Peak Period Heuristic for Railway Rolling Stock Planning. - Valentina Cacchiani; Alberto Caprara; Paolo Toth (Transp. Sci., 2019)

An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs. - Carlos Rey 001; Paolo Toth; Daniele Vigo (SCCC, 2020)

Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times. - Valentina Cacchiani; Carlos Contreras Bolton; Paolo Toth (Eur. J. Oper. Res., 2020)

Guest Editorial to the Feature Cluster "New Trends in Applied Combinatorial Optimization" (EURO/ALIO 2018). - Valentina Cacchiani; Enrico Malaguti; Paolo Toth (Eur. J. Oper. Res., 2021)

Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem. - Laura Galli; Silvano Martello; Carlos Rey 001; Paolo Toth (Eur. J. Oper. Res., 2021)

A gap in scientific reporting. - Gilbert Laporte; Paolo Toth (4OR, 2022)

A matheuristic algorithm for the pollution and energy minimization traveling salesman problems. - Valentina Cacchiani; Carlos Contreras Bolton; Luis Miguel Escobar-Falcón; Paolo Toth (Int. Trans. Oper. Res., 2023)

The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic. - Herminia I. Calvete; Carmen Galé; José A. Iranzo; Paolo Toth (Int. Trans. Oper. Res., 2023)

Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem. - Laura Galli; Silvano Martello; Carlos Rey 001; Paolo Toth (Discret. Appl. Math., 2023)

An iterated local search algorithm for latency vehicle routing problems with multiple depots. - Alan Osorio-Mora; John Willmer Escobar; Paolo Toth (Comput. Oper. Res., 2023)

Effective metaheuristics for the latency location routing problem. - Alan Osorio-Mora; Carlos Rey 001; Paolo Toth; Daniele Vigo (Int. Trans. Oper. Res., 2023)

Operational Research: methods and applications. - 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; et al. (J. Oper. Res. Soc., 2024)

The quadratic knapsack problem with setup. - Laura Galli; Silvano Martello; Carlos Rodrigo Rey Barra 001; Paolo Toth (Comput. Oper. Res., 2025)

The quadratic knapsack problem. - Laura Galli; Silvano Martello; Paolo Toth (Eur. J. Oper. Res., 2025)

A risk-averse latency location-routing problem with stochastic travel times. - Alan Osorio-Mora; Francisco Saldanha-da-Gama; Paolo Toth (Eur. J. Oper. Res., 2025)