The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Matteo Fischetti: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
    Solving the Prize-Collecting Steiner Tree Problem to Optimality. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:68-76 [Conf]
  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. 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]
  4. Leo G. Kroon, Matteo Fischetti
    Scheduling Train Drivers and Guards: The Dutch ``Noord-Oost'' Case. [Citation Graph (0, 0)][DBLP]
    HICSS, 2000, pp:- [Conf]
  5. Matteo Fischetti
    Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:260-273 [Conf]
  6. Matteo Fischetti, Andrea Lodi
    Optimizing over the First Chvàtal Closure. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:12-22 [Conf]
  7. Matteo Fischetti, Cristiano Saturni
    Mixed-Integer Cuts from Cyclic Groups. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:1-11 [Conf]
  8. Gianni Codato, Matteo Fischetti
    Combinatorial Benders' Cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:178-195 [Conf]
  9. Egon Balas, Matteo Fischetti
    On the monotonization of polyhedra. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:23-38 [Conf]
  10. Alberto Caprara, Matteo Fischetti, Adam N. Letchford
    On the Separation of Maximally Violated mod-k Cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:87-98 [Conf]
  11. 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]
  12. Lorenzo Brunetta, Michele Conforti, Matteo Fischetti
    A polyhedral approach to an integer multicommodity flow problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:13-36 [Journal]
  13. Matteo Fischetti
    Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:56, n:1, pp:9-18 [Journal]
  14. Egon Balas, Matteo Fischetti
    A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:58, n:, pp:325-352 [Journal]
  15. Egon Balas, Matteo Fischetti
    On the monotonization of polyhedra. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:77, n:, pp:59-84 [Journal]
  16. Egon Balas, Matteo Fischetti, William R. Pulleyblank
    The precedence-constrained asymmetric traveling salesman polytope. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:68, n:, pp:241-265 [Journal]
  17. Alberto Caprara, Matteo Fischetti
    {0, 1/2}-Chvátal-Gomory cuts. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:74, n:, pp:221-235 [Journal]
  18. 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]
  19. Matteo Fischetti
    Facts of two Steiner arborescence polyhedra. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:401-419 [Journal]
  20. Matteo Fischetti, Fred Glover, Andrea Lodi
    The feasibility pump. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:104, n:1, pp:91-104 [Journal]
  21. 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]
  22. 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]
  23. Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
    An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:427-449 [Journal]
  24. Matteo Fischetti, Cristiano Saturni
    Mixed-Integer Cuts from Cyclic Groups. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:109, n:1, pp:27-53 [Journal]
  25. Matteo Fischetti, Andrea Lodi
    Optimizing over the first Chvátal closure. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:3-20 [Journal]
  26. Norbert Ascheuer, Matteo Fischetti, Martin Grötschel
    A polyhedral study of the asymmetric traveling salesman problem with time windows. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:69-79 [Journal]
  27. Matteo Fischetti, Giuseppe Lancia, Paolo Serafini
    Exact algorithms for minimum routing cost trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:3, pp:161-173 [Journal]
  28. Matteo Fischetti, Carlo Polo, Massimo Scantamburlo
    A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:2, pp:61-72 [Journal]
  29. Matteo Fischetti, Daniele Vigo
    A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:1, pp:55-67 [Journal]
  30. Alberto Caprara, Matteo Fischetti, Dario Maio
    Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design. [Citation Graph (0, 17)][DBLP]
    IEEE Trans. Knowl. Data Eng., 1995, v:7, n:6, pp:955-967 [Journal]
  31. Matteo Fischetti, Giorgio Romanin Jacur, Juan José Salazar González
    Optimisation of the interconnecting network of a UMTS radio mobile telephone system. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:144, n:1, pp:56-67 [Journal]

  32. A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts. [Citation Graph (, )][DBLP]


  33. Towards a MIP-Cut Metascheme. [Citation Graph (, )][DBLP]


  34. An In-Out Approach to Disjunctive Optimization. [Citation Graph (, )][DBLP]


  35. Can Pure Cutting Plane Algorithms Work?. [Citation Graph (, )][DBLP]


  36. ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. [Citation Graph (, )][DBLP]


  37. Fast Approaches to Robust Railway Timetabling. [Citation Graph (, )][DBLP]


  38. ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. [Citation Graph (, )][DBLP]


  39. Robustness in Train Timetabling. [Citation Graph (, )][DBLP]


  40. Repairing MIP infeasibility through local branching. [Citation Graph (, )][DBLP]


  41. A new linear storage, polynomial-time approximation scheme for the subset-sum problem. [Citation Graph (, )][DBLP]


Search in 1.647secs, Finished in 1.650secs
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