The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paolo Toth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth
    Exact Solution of Large Scale Asymmetric Travelling Salesman Problems. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Math. Softw., 1995, v:21, n:4, pp:394-409 [Journal]
  2. Matteo Fischetti, Andrea Lodi, Paolo Toth
    Solving Real-World ATSP Instances by Branch-and-Cut. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:64-77 [Conf]
  3. Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth
    An MINLP Solution Method for a Water Network Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:696-707 [Conf]
  4. R. Rossi, M. Spadoni, Paolo Toth
    Operating Systems with Characteristics of Portability for Minicomputers. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1974, pp:377-385 [Conf]
  5. Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth
    Solution of Real-World Train Timetabling Problems. [Citation Graph (0, 0)][DBLP]
    HICSS, 2001, pp:- [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:110-123 [Conf]
  7. Alberto Caprara, Matteo Fischetti, Paolo Toth
    A Heuristic Algorithm for the Set Covering Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:72-84 [Conf]
  8. Silvano Martello, François Soumis, Paolo Toth
    An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:181-200 [Conf]
  9. Silvano Martello, Paolo Toth
    Generalized Assignment Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:351-369 [Conf]
  10. Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida
    A Lagrangian heuristic algorithm for a real-world train timetabling problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:5, pp:738-753 [Journal]
  11. Alberto Caprara, Paolo Toth
    Lower bounds and algorithms for the 2-dimensional vector packing problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:111, n:3, pp:231-262 [Journal]
  12. Mauro Dell'Amico, Paolo Toth
    Algorithms and codes for dense assignment problems: the state of the art. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:1-2, pp:17-48 [Journal]
  13. Silvano Martello, François Soumis, Paolo Toth
    Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:75, n:2, pp:169-188 [Journal]
  14. Paolo Toth, Daniele Vigo
    Models, relaxations and exact approaches for the capacitated vehicle routing problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:487-512 [Journal]
  15. Michele Monaci, Paolo Toth
    A Set-Covering-Based Heuristic Approach for Bin-Packing Problems. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2006, v:18, n:1, pp:71-85 [Journal]
  16. Paolo Toth, Daniele Vigo
    The Granular Tabu Search and Its Application to the Vehicle-Routing Problem. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2003, v:15, n:4, pp:333-346 [Journal]
  17. Silvano Martello, Paolo Toth
    A Note on 0.5-Bounded Greedy Algorithms for the 0/1 Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:4, pp:221-222 [Journal]
  18. Egon Balas, Donald Miller, Joseph Pekny, Paolo Toth
    A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:4, pp:985-1004 [Journal]
  19. Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida
    Algorithms for railway crew management. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:125-141 [Journal]
  20. Matteo Fischetti, Paolo Toth
    An additive bounding procedure for the asymmetric travelling salesman problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:173-197 [Journal]
  21. Roberto De Franceschi, Matteo Fischetti, Paolo Toth
    A new ILP-based refinement heuristic for Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:471-499 [Journal]
  22. 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. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1998, v:28, n:1, pp:49-76 [Journal]
  23. Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth
    Algorithm 750: CDT: A Subroutine for the Exact Solution of Large-Scale Asymmetric Travelling Salesman Problems. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1995, v:21, n:4, pp:410-415 [Journal]
  24. Giorgio Carpaneto, Paolo Toth
    Algorithm 548: Solution of the Assignment Problem [H]. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:1, pp:104-111 [Journal]
  25. Silvano Martello, Paolo Toth
    Algorithm 632: A Program for the 0-1 Multiple Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1985, v:11, n:2, pp:135-140 [Journal]

  26. Solving a Real-World Train Unit Assignment Problem. [Citation Graph (, )][DBLP]


  27. Solution of the Train Platforming Problem. [Citation Graph (, )][DBLP]


  28. A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem. [Citation Graph (, )][DBLP]


  29. Recent advances in vehicle routing exact algorithms. [Citation Graph (, )][DBLP]


  30. A column generation approach to train timetabling on a corridor. [Citation Graph (, )][DBLP]


  31. Algorithm for the solution of the assignment problem for sparse matrices. [Citation Graph (, )][DBLP]


  32. Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems. [Citation Graph (, )][DBLP]


  33. An ILP improvement procedure for the Open Vehicle Routing Problem. [Citation Graph (, )][DBLP]


  34. Lower bounds and reduction procedures for the bin packing problem. [Citation Graph (, )][DBLP]


Search in 0.018secs, Finished in 0.020secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002