 | 2008 |
|---|
| 44 |       | Valentina Cacchiani,
Albert Einstein Fernandez Muritiba,
Marcos Negreiros,
Paolo Toth:
A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem.
CTW 2008: 136-138 |
| 43 |  | Valentina Cacchiani,
Alberto Caprara,
Paolo Toth:
A column generation approach to train timetabling on a corridor.
4OR 6(2): 125-142 (2008) |
| 42 | | Enrico Malaguti,
Paolo Toth:
An evolutionary approach for bandwidth multicoloring problems.
European Journal of Operational Research 189(3): 638-651 (2008) |
| 41 | | Enrico Malaguti,
Michele Monaci,
Paolo Toth:
A Metaheuristic Approach for the Vertex Coloring Problem.
INFORMS Journal on Computing 20(2): 302-316 (2008) |
| 2007 |
|---|
| 40 | | Alberto Caprara,
Laura Galli,
Paolo Toth:
Solution of the Train Platforming Problem.
ATMOS 2007 |
| 39 | | Valentina Cacchiani,
Alberto Caprara,
Paolo Toth:
Solving a Real-World Train Unit Assignment Problem.
ATMOS 2007 |
| 38 | | Roberto Baldacci,
Paolo Toth,
Daniele Vigo:
Recent advances in vehicle routing exact algorithms.
4OR 5(4): 269-298 (2007) |
| 37 | | Daniele Vigo,
Paolo Toth,
Aristide Mingozzi:
Route 2005: Recent advances in vehicle routing optimization.
Networks 49(4): 243-244 (2007) |
| 2006 |
|---|
| 36 | | Cristiana Bragalli,
Claudia D'Ambrosio,
Jon Lee,
Andrea Lodi,
Paolo Toth:
An MINLP Solution Method for a Water Network Problem.
ESA 2006: 696-707 |
| 35 | | Alberto Caprara,
Michele Monaci,
Paolo Toth,
Pier Luigi Guida:
A Lagrangian heuristic algorithm for a real-world train timetabling problem.
Discrete Applied Mathematics 154(5): 738-753 (2006) |
| 34 | | Michele Monaci,
Paolo Toth:
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems.
INFORMS Journal on Computing 18(1): 71-85 (2006) |
| 33 | | 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) |
| 2003 |
|---|
| 32 | | Paolo Toth,
Daniele Vigo:
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem.
INFORMS Journal on Computing 15(4): 333-346 (2003) |
| 31 | | Silvano Martello,
Paolo Toth:
An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem.
Operations Research 51(5): 826-835 (2003) |
| 2002 |
|---|
| 30 | | Paolo Toth,
Daniele Vigo:
Models, relaxations and exact approaches for the capacitated vehicle routing problem.
Discrete Applied Mathematics 123(1-3): 487-512 (2002) |
| 29 | | Alberto Caprara,
Matteo Fischetti,
Paolo Toth:
Modeling and Solving the Train Timetabling Problem.
Operations Research 50(5): 851-861 (2002) |
| 2001 |
|---|
| 28 | | Matteo Fischetti,
Andrea Lodi,
Paolo Toth:
Solving Real-World ATSP Instances by Branch-and-Cut.
Combinatorial Optimization 2001: 64-77 |
| 27 | | Alberto Caprara,
Matteo Fischetti,
Pier Luigi Guida,
Michele Monaci,
Giuseppe Sacco,
Paolo Toth:
Solution of Real-World Train Timetabling Problems.
HICSS 2001 |
| 26 | | Alberto Caprara,
Paolo Toth:
Lower bounds and algorithms for the 2-dimensional vector packing problem.
Discrete Applied Mathematics 111(3): 231-262 (2001) |
| 25 | | 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.
Transportation Science 35(1): 99-103 (2001) |
| 2000 |
|---|
| 24 | | Mauro Dell'Amico,
Paolo Toth:
Algorithms and codes for dense assignment problems: the state of the art.
Discrete Applied Mathematics 100(1-2): 17-48 (2000) |
| 1999 |
|---|
| 23 | | Alberto Caprara,
David Pisinger,
Paolo Toth:
Exact Solution of the Quadratic Knapsack Problem.
INFORMS Journal on Computing 11(2): 125-137 (1999) |
| 1998 |
|---|
| 22 | | Matteo Fischetti,
Juan José Salazar González,
Paolo Toth:
Solving the Orienteering Problem through Branch-and-Cut.
INFORMS Journal on Computing 10(2): 133-148 (1998) |
| 21 | | 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. Exper. 28(1): 49-76 (1998) |
| 20 | | Jean-François Cordeau,
Paolo Toth,
Daniele Vigo:
A Survey of Optimization Models for Train Routing and Scheduling.
Transportation Science 32(4): 380-404 (1998) |
| 1997 |
|---|
| 19 | | Silvano Martello,
François Soumis,
Paolo Toth:
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines.
Discrete Applied Mathematics 75(2): 169-188 (1997) |
| 18 | | Alberto Caprara,
Matteo Fischetti,
Paolo Toth,
Daniele Vigo,
Pier Luigi Guida:
Algorithms for railway crew management.
Math. Program. 79: 125-141 (1997) |
| 17 | | Paolo Toth,
Daniele Vigo:
Heuristic Algorithms for the Handicapped Persons Transportation Problem.
Transportation Science 31(1): 60-71 (1997) |
| 16 | | Paolo Toth,
Daniele Vigo:
An Exact Algorithm for the Vehicle Routing Problem with Backhauls.
Transportation Science 31(4): 372-385 (1997) |
| 1996 |
|---|
| 15 | | Alberto Caprara,
Matteo Fischetti,
Paolo Toth:
A Heuristic Algorithm for the Set Covering Problem.
IPCO 1996: 72-84 |
| 1995 |
|---|
| 14 | | 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 |
| 13 | | 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) |
| 12 | | 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) |
| 1993 |
|---|
| 11 | | Matteo Fischetti,
Paolo Toth:
An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs.
INFORMS Journal on Computing 5(4): 426-434 (1993) |
| 1992 |
|---|
| 10 | | Silvano Martello,
François Soumis,
Paolo Toth:
An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines.
IPCO 1992: 181-200 |
| 9 | | Silvano Martello,
Paolo Toth:
Generalized Assignment Problems.
ISAAC 1992: 351-369 |
| 8 | | 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) |
| 7 | | Matteo Fischetti,
Paolo Toth:
An additive bounding procedure for the asymmetric travelling salesman problem.
Math. Program. 53: 173-197 (1992) |
| 1991 |
|---|
| 6 | | 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 |
|---|
| 5 | | Silvano Martello,
Paolo Toth:
Lower bounds and reduction procedures for the bin packing problem.
Discrete Applied Mathematics 28(1): 59-70 (1990) |
| 1985 |
|---|
| 4 | | Silvano Martello,
Paolo Toth:
Algorithm 632: A Program for the 0-1 Multiple Knapsack Problem.
ACM Trans. Math. Softw. 11(2): 135-140 (1985) |
| 1983 |
|---|
| 3 | | Giorgio Carpaneto,
Paolo Toth:
Algorithm for the solution of the assignment problem for sparse matrices.
Computing 31(1): 83-94 (1983) |
| 1980 |
|---|
| 2 | | Giorgio Carpaneto,
Paolo Toth:
Algorithm 548: Solution of the Assignment Problem [H].
ACM Trans. Math. Softw. 6(1): 104-111 (1980) |
| 1974 |
|---|
| 1 | | R. Rossi,
M. Spadoni,
Paolo Toth:
Operating Systems with Characteristics of Portability for Minicomputers.
GI Jahrestagung 1974: 377-385 |
