vai alle Pubblicazioni
Pubblicazioni antecedenti il 2004
List of publications by Daniele Vigo (1994-2003)
Papers in International Journals
[1] Matteo Fischetti, Paolo Toth, Daniele Vigo. A branch-and-bound
algorithm for the capacitated vehicle routing problem on directed
graphs. Operations Research, 42(5):846-859, 1994.
[2] Mauro Dell'Amico, Silvano Martello, Daniele Vigo. Minimizing
the sum of weighted completion times with unrestricted weights.
Discrete Applied Mathematics, 63:25-41, 1995.
[3] Paolo Toth and Daniele Vigo. An exact algorithm for the
capacitated shortest spanning arborescence. Annals of Operations
Research, 61:121-142, 1995.
[4] Daniele Vigo. A heuristic algorithm for the asymmetric
capacitated vehicle routing problem. European Journal of
Operational Research, 89:108-126, 1996.
[5] David Alcaide, Joaquin Sicilia, Daniele Vigo. A tabu search
algorithm for the open shop problem. TOP, 5:283-296, 1997.
[6] Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo,
Pier Luigi Guida. Algorithms for railway crew management.
Mathematical Programming, 79:125-141, 1997.
[7] Matteo Fischetti and Daniele Vigo. A branch and cut algorithm
for the resource-constrained minimum-weight arborescence problem.
Networks, 29:55-67, 1997.
[8] Paolo Toth and Daniele Vigo. An exact algorithm for the vehicle
routing problem with backhauls. Transportation Science, 31:372-385,
1997.
[9] Paolo Toth and Daniele Vigo. Heuristic algorithms for the
handicapped persons transportation problem. Transportation Science,
31:60-71, 1997.
[10] Daniele Vigo and Vittorio Maniezzo. A genetic/tabu
thresholding hybrid algorithm for the process allocation problem.
Journal of Heuristics, 3:91-110, 1997.
[11] Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo.
Modeling and solving the crew rostering problem. Operations
Research, 46:820{830, 1998.
[12] 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. Software { Practice and Experience, 28(1):49{76,
1998.
[13] Jean-Francois Cordeau, Paolo Toth, Daniele Vigo. A survey of
optimization models for train routing and scheduling.
Transportation Science, 32:380{404, 1998.
[14] Silvano Martello and Daniele Vigo. Exact solution of the
two-dimensional nite bin packing problem. Management Science,
44:388{
399, 1998.
[15] Filippo Focacci, Andrea Lodi, Michela Milano, Daniele Vigo.
Solving the tsp through the integration of or and cp techniques.
Electronic Notes in Discrete Mathematics, 1, 1999.
[16] Michel Gendreau, Gilbert Laporte, Daniele Vigo. Heuristics for
the traveling salesman problem with pickup and delivery. Computers
and Operations Research, 26:699{714, 1999.
[17] Andrea Lodi, Silvano Martello, Daniele Vigo. Approximation
algorithms for the two-dimensional oriented bin packing problem.
European Journal of Operational Research, 112:158{166, 1999.
[18] Andrea Lodi, Silvano Martello, Daniele Vigo. Heuristic and
metaheuristic approaches for a class of two-dimensional bin packing
problem. INFORMS Journal on Computing, 11:345{357, 1999.
[19] Paolo Toth and Daniele Vigo. A heuristic algorithm for the
symmetric and asymmetric vehicle routing problems with backhauls.
European Journal of Operational Research, 113:528{543, 1999.
[20] Andrea Lodi, Daniele Vigo, Cinzia Zannoni. Exact and heuristic
algorithms for data sets reconstruction. European Journal of
Operational Research, 124:139{150, 2000.
[21] Silvano Martello, David Pisinger, Daniele Vigo. The
three-dimensional bin packing problem. Operations Research,
48:256{267, 2000.
[22] Mauro Dell'Amico, Silvano Martello, Daniele Vigo. A lower
bound for the non-oriented two-dimensional bin packing problem.
Discrete Applied Mathematics, 118:13{24, 2002.
[23] Andrea Lodi, Silvano Martello, Daniele Vigo. Heuristic
algorithms for the three-dimensional bin packing problem. European
Journal of Operational Research, 141:130{140, 2002.
[24] Andrea Lodi, Silvano Martello, Daniele Vigo. Recent advances
on two-dimensional bin packing problems. Discrete Applied
Mathematics, 123/124:373{390, 2002.
[25] Paolo Toth and Daniele Vigo. Models, relaxations and exact
approaches for the capacitated vehicle routing problem. Discrete
Applied Mathematics, 123/124:481{506, 2002.
[26] Silvano Martello, Michele Monaci, Daniele Vigo. An exact
approach to the strip packing problem. INFORMS Journal on Computing
15(3):310{319, 2003.
[27] Paolo Toth and Daniele Vigo. The granular tabu search (and its
application to the vehicle routing problem). INFORMS Journal on
Computing 15(4):333{346, 2003.
Chapters in International Books
[39] Antonio Corradi, Letizia Leonardi, Daniele Vigo. Massively
parallel programming environments: How to map parallel objects on
transputers. In M. Becker, L. Litzler, M. Trehel, editors,
TRANSPUTERS'92: Advanced Research and Industrial Applications,
pages 125{141. I.O.S. Press, Amsterdam, 1992.
[40] Mauro Dell'Amico, Silvano Martello, Daniele Vigo. Heuristic
algorithms for single processor scheduling with earliness and
flow time penalties. In Ibrahim H. Osman and James P. Kelly,
editors, MetaHeuristics: Theory and Applications, pages 167{182.
Kluwer Academic Publishers, Boston, 1996.
[41] Paolo Toth and Daniele Vigo. Fast local search algorithms for
the handicapped persons transportation problem. In Ibrahim H. Osman
and James P. Kelly, editors, Meta-Heuristics: Theory and
Applications, pages 677{690. Kluwer Academic Publishers, Boston,
1996.
[42] Paolo Toth and Daniele Vigo. A heuristic algorithm for the
vehicle routing problem with backhauls. In Lucio Bianco and Paolo
Toth,
editors, Advanced Methods in Transportation Analysis, pages
585{608. Springer Verlag, Berlin, 1996.
[43] Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Paolo
Toth, Daniele Vigo. Crew scheduling and rostering problems in
railway applications. In M. Labbe, G. Laporte, K. Tcanzos, P.
Toint, editors, Operations Research and Decision Aid Methodologies
in Traffic and Transportation Management, volume 166 of Computer
and Systems Sciences, pages 228{243. Springer Verlag, Berlin,
1998.
[44] Paolo Toth and Daniele Vigo. Exact algorithms for vehicle
routing. In Teodor Crainic and Gilbert Laporte, editors, Fleet
Management and Logistics, pages 1{31. Kluwer Academic Publishers,
Boston, 1998.
[45] Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Paolo
Toth, Daniele Vigo. Solution of large-scale railway crew planning
problems: the italian experience. In N.H.M. Wilson, editor,
Computer-Aided Transit Scheduling, volume 471 of Lecture Notes in
Economics and Mathematical Systems, pages 1{18. Springer Verlag,
Berlin, 1999.
[46] Edward G. Coman Jr., Gabor Galambos, Silvano Martello, Daniele
Vigo. Bin packing approximation algorithms: Combinatorial analysis.
In D.-Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial
Optimization, Supplement Volume A, pages 151{207. Kluwer Academic
Publishers, Dordrecht, 1999.
[47] Andrea Lodi, Silvano Martello, Daniele Vigo. Neighborhood
search algorithm for the non-oriented two-dimensional bin packing
problem. In Stephan Voss, Silvano Martello, Ibrahim H. Osman,
Catherine Roucairol, editors, Meta-Heuristics: Advances and Trends
in Local Search Paradigms for Optimization, pages 125{140. Kluwer
Academic Publishers, Boston, 1999.
[48] Paolo Toth and Daniele Vigo. An overview of vehicle routing
problems.In Paolo Toth and Daniele Vigo, editors, The Vehicle
Routing Problem, Monographs on Discrete Mathematics and
Applications, pages 1{26. S.I.A.M., Philadelpia, PA, 2002.
[49] Paolo Toth and Daniele Vigo. Branch-and-bound algorithms for
the capacitated VRP. In Paolo Toth and Daniele Vigo, editors, The
Vehicle Routing Problem, Monographs on Discrete Mathematics and
Applications, pages 29{51. S.I.A.M., Philadelpia, PA, 2002.
[50] Paolo Toth and Daniele Vigo. VRP with backhauls. In Paolo Toth
and Daniele Vigo, editors, The Vehicle Routing Problem, Monographs
on Discrete Mathematics and Applications, pages 195{224. S.I.A.M.,
Philadelpia, PA, 2002.
