Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDPaolo Toth
Person information
- affiliation: University of Bologna, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j117]Valentina Cacchiani, Enrico Malaguti, Paolo Toth:
Guest Editorial to the Feature Cluster "New Trends in Applied Combinatorial Optimization" (EURO/ALIO 2018). Eur. J. Oper. Res. 289(3): 807-808 (2021)- [j116]Laura Galli, Silvano Martello, Carlos Rey, Paolo Toth:
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem. Eur. J. Oper. Res. 291(3): 871-882 (2021) - 2020
- [j115]Valentina Cacchiani, Carlos Contreras Bolton
, Paolo Toth:
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times. Eur. J. Oper. Res. 283(3): 825-843 (2020) - [c20]Carlos Rey, Paolo Toth, Daniele Vigo:
An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs. SCCC 2020: 1-8
2010 – 2019
- 2019
- [j114]Immanuel M. Bomze, Paolo Toth:
Egon Balas (1922-2019). Eur. J. Oper. Res. 278(1): 1-2 (2019) - [j113]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
An Effective Peak Period Heuristic for Railway Rolling Stock Planning. Transp. Sci. 53(3): 746-762 (2019) - 2018
- [j112]Herminia I. Calvete, Carmen Galé, José A. Iranzo, Paolo Toth:
A matheuristic for the two-stage fixed-charge transportation problem. Comput. Oper. Res. 95: 113-122 (2018) - [j111]Valentina Cacchiani, Enrico Malaguti, Antonio Mauttone, Paolo Toth:
Preface. Electron. Notes Discret. Math. 69: 1-3 (2018) - 2016
- [j110]Valentina Cacchiani, Feng Jiang, Paolo Toth:
Timetable Optimization for High-Speed Trains at Chinese Railways. Electron. Notes Discret. Math. 55: 29-32 (2016) - [j109]Enrico Malaguti, Rosa Medina Durán, Paolo Toth:
A metaheuristic framework for Nonlinear Capacitated Covering Problems. Optim. Lett. 10(1): 169-180 (2016) - [j108]Lucas P. Veelenturf, Martin Philip Kidd, Valentina Cacchiani, Leo G. Kroon, Paolo Toth:
A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions. Transp. Sci. 50(3): 841-862 (2016) - 2015
- [j107]Valentina Cacchiani, Laura Galli, Paolo Toth:
A tutorial on non-periodic train timetabling and platforming problems. EURO J. Transp. Logist. 4(3): 285-320 (2015) - [j106]Eduardo Álvarez-Miranda, Ivana Ljubic, S. Raghavan, Paolo Toth:
The Recoverable Robust Two-Level Network Design Problem. INFORMS J. Comput. 27(1): 1-19 (2015) - [j105]Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth:
Improved rolling horizon approaches to the aircraft sequencing problem. J. Sched. 18(5): 435-447 (2015) - 2014
- [j104]Francisco Pérez-Galarce, Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Paolo Toth:
On exact solutions for the Minmax Regret Spanning Tree problem. Comput. Oper. Res. 47: 114-122 (2014) - [j103]Paolo Toth, Daniele Vigo:
Guest editorial to the Special Issue "Routing and Logistics" (VeRoLog 2012). Eur. J. Oper. Res. 236(3): 787-788 (2014) - [j102]John Willmer Escobar, Rodrigo Linfati, Paolo Toth, María G. Baldoquín:
A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem. J. Heuristics 20(5): 483-509 (2014) - [j101]Alberto Caprara, Laura Galli, Sebastian Stiller, Paolo Toth:
Delay-Robust Event Scheduling. Oper. Res. 62(2): 274-283 (2014) - [j100]Erika Buson, Roberto Roberti, Paolo Toth:
A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem. Oper. Res. 62(5): 1095-1106 (2014) - [c19]Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth:
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting. ISCO 2014: 267-279 - [p6]Stefan Irnich, Paolo Toth, Daniele Vigo:
The Family of Vehicle Routing Problems. Vehicle Routing 2014: 1-33 - [p5]Frédéric Semet, Paolo Toth, Daniele Vigo:
Classical Exact Algorithms for the Capacitated Vehicle Routing Problem. Vehicle Routing 2014: 37-57 - [e3]Paolo Toth, Daniele Vigo:
Vehicle Routing. MOS-SIAM Series on Optimization 18, SIAM 2014, ISBN 978-1-611-97358-7 [contents] - 2013
- [j99]Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth:
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 4OR 11(4): 349-360 (2013) - [j98]John Willmer Escobar, Rodrigo Linfati, Paolo Toth:
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Comput. Oper. Res. 40(1): 70-79 (2013) - [j97]Valentina Cacchiani, Alberto Caprara, Roberto Roberti, Paolo Toth:
A new lower bound for curriculum-based course timetabling. Comput. Oper. Res. 40(10): 2466-2477 (2013) - [j96]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A Lagrangian heuristic for a train-unit assignment problem. Discret. Appl. Math. 161(12): 1707-1718 (2013) - [j95]Gilbert Laporte, Paolo Toth, Daniele Vigo:
Vehicle routing: historical perspective and recent contributions. EURO J. Transp. Logist. 2(1-2): 1-4 (2013) - [j94]Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth:
Exact approaches for solving robust prize-collecting Steiner tree problems. Eur. J. Oper. Res. 229(3): 599-612 (2013) - [j93]Aristide Mingozzi, Roberto Roberti, Paolo Toth:
An Exact Algorithm for the Multitrip Vehicle Routing Problem. INFORMS J. Comput. 25(2): 193-207 (2013) - [j92]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Finding cliques of maximum weight on a generalization of permutation graphs. Optim. Lett. 7(2): 289-296 (2013) - [j91]Valentina Cacchiani, Alberto Caprara, Gábor Maróti, Paolo Toth:
On integer polytopes with few nonzero vertices. Oper. Res. Lett. 41(1): 74-77 (2013) - 2012
- [j90]Roberto Roberti, Paolo Toth:
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison. EURO J. Transp. Logist. 1(1-2): 113-133 (2012) - [j89]Zahra Naji Azimi, Majid Salari, Paolo Toth:
An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem. Eur. J. Oper. Res. 217(1): 17-25 (2012) - [j88]Fabio Furini, Enrico Malaguti, Rosa Medina Durán, Alfredo Persiani, Paolo Toth:
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. Eur. J. Oper. Res. 218(1): 251-260 (2012) - [j87]Valentina Cacchiani, Paolo Toth:
Nominal and robust train timetabling problems. Eur. J. Oper. Res. 219(3): 727-737 (2012) - [j86]Bruce L. Golden, Zahra Naji Azimi, S. Raghavan, Majid Salari, Paolo Toth:
The Generalized Covering Salesman Problem. INFORMS J. Comput. 24(4): 534-553 (2012) - [j85]Valentina Cacchiani, Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti, Paolo Toth:
Railway Rolling Stock Planning: Robustness Against Large Disruptions. Transp. Sci. 46(2): 217-232 (2012) - [c18]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A Fast Heuristic Algorithm for the Train Unit Assignment Problem. ATMOS 2012: 1-9 - [c17]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Models and Algorithms for the Train Unit Assignment Problem. ISCO 2012: 24-35 - [c16]Fabio Furini, Carlo Alfredo Persiani, Paolo Toth:
Aircraft Sequencing Problems via a Rolling Horizon Algorithm. ISCO 2012: 273-284 - 2011
- [j84]Enrico Malaguti, Michele Monaci, Paolo Toth:
An exact approach for the Vertex Coloring Problem. Discret. Optim. 8(2): 174-190 (2011) - [j83]Valentina Cacchiani, Albert Einstein Fernandes Muritiba, Marcos Negreiros, Paolo Toth:
A multistart heuristic for the equality generalized traveling salesman problem. Networks 57(3): 231-239 (2011) - [j82]Alberto Caprara, Enrico Malaguti, Paolo Toth:
A Freight Service Design Problem for a Railway Corridor. Transp. Sci. 45(2): 147-162 (2011) - [j81]Alberto Caprara, Laura Galli, Paolo Toth:
Solution of the Train Platforming Problem. Transp. Sci. 45(2): 246-257 (2011) - [c15]Isabel Méndez-Díaz, Juan José Miranda Bront, Paolo Toth, Paula Zabala:
Infeasible path formulations for the time-dependent TSP with time windows. CTW 2011: 198-202 - [c14]Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth:
Exact solutions for the robust prize-collecting steiner tree problem. ICUMT 2011: 1-7 - 2010
- [j80]Roberto Baldacci, Paolo Toth, Daniele Vigo:
Exact algorithms for routing problems under vehicle capacity constraints. Ann. Oper. Res. 175(1): 213-245 (2010) - [j79]Paolo Toth:
Foreword. Comput. Manag. Sci. 7(3): 225-227 (2010) - [j78]Zahra Naji Azimi, Majid Salari, Bruce L. Golden, S. Raghavan, Paolo Toth:
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems. Comput. Oper. Res. 37(11): 1952-1964 (2010) - [j77]Majid Salari, Paolo Toth, Andrea Tramontani:
An ILP improvement procedure for the Open Vehicle Routing Problem. Comput. Oper. Res. 37(12): 2106-2120 (2010) - [j76]Majid Salari, Zahra Naji Azimi, Paolo Toth:
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization. Electron. Notes Discret. Math. 36: 343-350 (2010) - [j75]Zahra Naji Azimi, Paolo Toth, Laura Galli:
An electromagnetism metaheuristic for the unicost set covering problem. Eur. J. Oper. Res. 205(2): 290-300 (2010) - [j74]Zahra Naji Azimi, Majid Salari, Paolo Toth:
A heuristic procedure for the Capacitated m-Ring-Star problem. Eur. J. Oper. Res. 207(3): 1227-1234 (2010) - [j73]Albert Einstein Fernandes Muritiba, Manuel Iori, Enrico Malaguti, Paolo Toth:
Algorithms for the Bin Packing Problem with Conflicts. INFORMS J. Comput. 22(3): 401-415 (2010) - [j72]Enrico Malaguti, Paolo Toth:
A survey on vertex coloring problems. Int. Trans. Oper. Res. 17(1): 1-34 (2010) - [j71]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Solving a real-world train-unit assignment problem. Math. Program. 124(1-2): 207-231 (2010) - [j70]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Non-cyclic train timetabling and comparability graphs. Oper. Res. Lett. 38(3): 179-184 (2010) - [c13]Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti, Paolo Toth:
Robust Train Routing and Online Re-scheduling. ATMOS 2010: 24-33 - [c12]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A Heuristic Algorithm for the Train-Unit Assignment Problem. CTW 2010: 33-36 - [e2]Andrea Lodi, Michela Milano, Paolo Toth:
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. Lecture Notes in Computer Science 6140, Springer 2010 [contents]
2000 – 2009
- 2009
- [j69]Enrico Malaguti, Michele Monaci, Paolo Toth:
Models and heuristic algorithms for a weighted vertex coloring problem. J. Heuristics 15(5): 503-526 (2009) - 2008
- [j68]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A column generation approach to train timetabling on a corridor. 4OR 6(2): 125-142 (2008) - [j67]Enrico Malaguti, Paolo Toth:
An evolutionary approach for bandwidth multicoloring problems. Eur. J. Oper. Res. 189(3): 638-651 (2008) - [j66]Enrico Malaguti, Michele Monaci, Paolo Toth:
A Metaheuristic Approach for the Vertex Coloring Problem. INFORMS J. Comput. 20(2): 302-316 (2008) - [c11]Valentina Cacchiani, Albert Einstein Fernandes Muritiba, Marcos Negreiros, Paolo Toth:
A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem. CTW 2008: 136-138 - 2007
- [j65]Roberto Baldacci, Paolo Toth, Daniele Vigo:
Recent advances in vehicle routing exact algorithms. 4OR 5(4): 269-298 (2007) - [j64]Daniele Vigo, Paolo Toth, Aristide Mingozzi:
Route 2005: Recent advances in vehicle routing optimization. Networks 49(4): 243-244 (2007) - [c10]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Solving a Real-World Train Unit Assignment Problem. ATMOS 2007 - [c9]Alberto Caprara, Laura Galli, Paolo Toth:
Solution of the Train Platforming Problem. ATMOS 2007 - [p4]Alberto Caprara, Leo G. Kroon, Michele Monaci, Marc Peeters, Paolo Toth:
Chapter 3 Passenger Railway Optimization. Transportation 2007: 129-187 - 2006
- [j63]Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida:
A Lagrangian heuristic algorithm for a real-world train timetabling problem. Discret. Appl. Math. 154(5): 738-753 (2006) - [j62]Michele Monaci, Paolo Toth:
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems. INFORMS J. Comput. 18(1): 71-85 (2006) - [j61]Roberto De Franceschi, Matteo Fischetti, Paolo Toth:
A new ILP-based refinement heuristic for Vehicle Routing Problems. Math. Program. 105(2-3): 471-499 (2006) - [c8]Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth:
An MINLP Solution Method for a Water Network Problem. ESA 2006: 696-707 - 2003
- [j60]Paolo Toth, Daniele Vigo:
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem. INFORMS J. Comput. 15(4): 333-346 (2003) - [j59]Silvano Martello, Paolo Toth:
An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem. Oper. Res. 51(5): 826-835 (2003) - [j58]Alberto Caprara, Michele Monaci, Paolo Toth:
Models and algorithms for a staff scheduling problem. Math. Program. 98(1-3): 445-476 (2003) - 2002
- [j57]Paolo Toth, Daniele Vigo:
Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discret. Appl. Math. 123(1-3): 487-512 (2002) - [j56]Nei Yoshihiro Soma, Paolo Toth:
An exact algorithm for the subset sum problem. Eur. J. Oper. Res. 136(1): 57-66 (2002) - [j55]Alberto Caprara, Matteo Fischetti, Paolo Toth:
Modeling and Solving the Train Timetabling Problem. Oper. Res. 50(5): 851-861 (2002) - [p3]Paolo Toth, Daniele Vigo:
An Overview of Vehicle Routing Problems. The Vehicle Routing Problem 2002: 1-26 - [p2]Paolo Toth, Daniele Vigo:
Branch-And-Bound Algorithms for the Capacitated VRP. The Vehicle Routing Problem 2002: 29-51 - [p1]Paolo Toth, Daniele Vigo:
VRP with Backhauls. The Vehicle Routing Problem 2002: 195-224 - [e1]Paolo Toth, Daniele Vigo:
The Vehicle Routing Problem. SIAM monographs on discrete mathematics and applications 9, SIAM 2002, ISBN 978-0-89871-498-2 [contents] - 2001
- [j54]Alberto Caprara, Paolo Toth:
Lower bounds and algorithms for the 2-dimensional vector packing problem. Discret. Appl. Math. 111(3): 231-262 (2001) - [j53]Matteo Fischetti, Andrea Lodi, Silvano Martello, Paolo Toth:
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems. Manag. Sci. 47(6): 833-850 (2001) - [j52]Paolo Toth, Hillel Bar-Gera, Diego Klabjan, Roberto Baldacci, Cenk Çaliskan, Christina Diakaki, Lasse Fridström, Vijay S. Nori:
Abstracts for the 2000 Transportation Science Section Dissertation Prize Competition. Transp. Sci. 35(1): 99-103 (2001) - [c7]Matteo Fischetti, Andrea Lodi, Paolo Toth:
Solving Real-World ATSP Instances by Branch-and-Cut. Combinatorial Optimization 2001: 64-77 - [c6]Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth:
Solution of Real-World Train Timetabling Problems. HICSS 2001 - 2000
- [j51]Alberto Caprara, Paolo Toth, Matteo Fischetti:
Algorithms for the Set Covering Problem. Ann. Oper. Res. 98(1-4): 353-371 (2000) - [j50]Mauro Dell'Amico, Paolo Toth:
Algorithms and codes for dense assignment problems: the state of the art. Discret. Appl. Math. 100(1-2): 17-48 (2000) - [j49]Silvano Martello, David Pisinger, Paolo Toth:
New trends in exact algorithms for the 0-1 knapsack problem. Eur. J. Oper. Res. 123(2): 325-332 (2000) - [j48]Paolo Toth:
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems. Eur. J. Oper. Res. 125(2): 222-238 (2000)
1990 – 1999
- 1999
- [j47]Paolo Toth, Daniele Vigo:
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. Eur. J. Oper. Res. 113(3): 528-543 (1999) - [j46]Alberto Caprara, David Pisinger, Paolo Toth:
Exact Solution of the Quadratic Knapsack Problem. INFORMS J. Comput. 11(2): 125-137 (1999) - [j45]Alberto Caprara, Matteo Fischetti, Paolo Toth:
A Heuristic Method for the Set Covering Problem. Oper. Res. 47(5): 730-743 (1999) - 1998
- [j44]Laureano F. Escudero, Silvano Martello, Paolo Toth:
On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems. Ann. Oper. Res. 81: 379-404 (1998) - [j43]Matteo Fischetti, Juan José Salazar González, Paolo Toth:
Solving the Orienteering Problem through Branch-and-Cut. INFORMS J. Comput. 10(2): 133-148 (1998) - [j42]Alberto Caprara, Paolo Toth, Daniele Vigo, Matteo Fischetti:
Modeling and Solving the Crew Rostering Problem. Oper. Res. 46(6): 820-830 (1998) - [j41]Alberto Caprara, Filippo Focacci, Evelina Lamma, Paola Mello, Michela Milano, Paolo Toth, Daniele Vigo:
Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem. Softw. Pract. Exp. 28(1): 49-76 (1998) - [j40]Jean-François Cordeau, Paolo Toth, Daniele Vigo:
A Survey of Optimization Models for Train Routing and Scheduling. Transp. Sci. 32(4): 380-404 (1998) - 1997
- [j39]Silvano Martello, François Soumis, Paolo Toth:
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines. Discret. Appl. Math. 75(2): 169-188 (1997) - [j38]Matteo Fischetti, Juan José Salazar González, Paolo Toth:
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem. Oper. Res. 45(3): 378-394 (1997) - [j37]Silvano Martello, Paolo Toth:
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems. Oper. Res. 45(5): 768-778 (1997) - [j36]Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida:
Algorithms for railway crew management. Math. Program. 79: 125-141 (1997) - [j35]Paolo Toth, Daniele Vigo:
Heuristic Algorithms for the Handicapped Persons Transportation Problem. Transp. Sci. 31(1): 60-71 (1997) - [j34]Paolo Toth, Daniele Vigo:
An Exact Algorithm for the Vehicle Routing Problem with Backhauls. Transp. Sci. 31(4): 372-385 (1997) - 1996
- [c5]Alberto Caprara, Matteo Fischetti, Paolo Toth:
A Heuristic Algorithm for the Set Covering Problem. IPCO 1996: 72-84 - 1995
- [j33]Paolo Toth, Daniele Vigo:
An exact algorithm for the capacitated shortest spanning arborescence. Ann. Oper. Res. 61(1): 121-141 (1995) - [j32]Matteo Fischetti, Juan José Salazar González, Paolo Toth:
The symmetric generalized traveling salesman polytope. Networks 26(2): 113-123 (1995) - [j31]Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth:
Exact Solution of Large Scale Asymmetric Travelling Salesman Problems. ACM Trans. Math. Softw. 21(4): 394-409 (1995) - [j30]Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth:
Algorithm 750: CDT: A Subroutine for the Exact Solution of Large-Scale Asymmetric Travelling Salesman Problems. ACM Trans. Math. Softw. 21(4): 410-415 (1995) - [c4]Laureano F. Escudero, Silvano Martello, Paolo Toth:
A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems. IPCO 1995: 110-123 - 1994
- [j29]Matteo Fischetti, Paolo Toth, Daniele Vigo:
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs. Oper. Res. 42(5): 846-859 (1994) - 1993
- [j28]Matteo Fischetti, Paolo Toth:
An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs. INFORMS J. Comput. 5(4): 426-434 (1993) - 1992
- [j27]Matteo Fischetti, Silvano Martello, Paolo Toth:
Approximation Algorithms for Fixed Job Schedule Problems. Oper. Res. 40(Supplement-1): S96-S108 (1992) - [j26]Silvano Martello, Paolo Toth:
A Note on 0.5-Bounded Greedy Algorithms for the 0/1 Knapsack Problem. Inf. Process. Lett. 44(4): 221-222 (1992) - [j25]Matteo Fischetti, Paolo Toth:
An additive bounding procedure for the asymmetric travelling salesman problem. Math. Program. 53: 173-197 (1992) - [c3]Silvano Martello, François Soumis, Paolo Toth:
An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines. IPCO 1992: 181-200 - [c2]Silvano Martello, Paolo Toth:
Generalized Assignment Problems. ISAAC 1992: 351-369 - 1991
- [j24]Egon Balas, Donald L. Miller, Joseph F. Pekny, Paolo Toth:
A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem. J. ACM 38(4): 985-1004 (1991) - 1990
- [j23]Silvano Martello, Paolo Toth:
Lower bounds and reduction procedures for the bin packing problem. Discret. Appl. Math. 28(1): 59-70 (1990)
1980 – 1989
- 1989
- [j22]Matteo Fischetti, Paolo Toth:
An Additive Bounding Procedure for Combinatorial Optimization Problems. Oper. Res. 37(2): 319-328 (1989) - [j21]