Search the dblp DataBase
Matteo Fischetti :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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 ] 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 ] 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 ] Leo G. Kroon , Matteo Fischetti Scheduling Train Drivers and Guards: The Dutch ``Noord-Oost'' Case. [Citation Graph (0, 0)][DBLP ] HICSS, 2000, pp:- [Conf ] Matteo Fischetti Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope. [Citation Graph (0, 0)][DBLP ] IPCO, 1992, pp:260-273 [Conf ] Matteo Fischetti , Andrea Lodi Optimizing over the First Chvàtal Closure. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:12-22 [Conf ] Matteo Fischetti , Cristiano Saturni Mixed-Integer Cuts from Cyclic Groups. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:1-11 [Conf ] Gianni Codato , Matteo Fischetti Combinatorial Benders' Cuts. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:178-195 [Conf ] Egon Balas , Matteo Fischetti On the monotonization of polyhedra. [Citation Graph (0, 0)][DBLP ] IPCO, 1993, pp:23-38 [Conf ] 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 ] 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 ] 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 ] 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 ] 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 ] Egon Balas , Matteo Fischetti On the monotonization of polyhedra. [Citation Graph (0, 0)][DBLP ] Math. Program., 1997, v:77, n:, pp:59-84 [Journal ] 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 ] 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 ] 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 ] Matteo Fischetti Facts of two Steiner arborescence polyhedra. [Citation Graph (0, 0)][DBLP ] Math. Program., 1991, v:51, n:, pp:401-419 [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts. [Citation Graph (, )][DBLP ] Towards a MIP-Cut Metascheme. [Citation Graph (, )][DBLP ] An In-Out Approach to Disjunctive Optimization. [Citation Graph (, )][DBLP ] Can Pure Cutting Plane Algorithms Work?. [Citation Graph (, )][DBLP ] ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. [Citation Graph (, )][DBLP ] Fast Approaches to Robust Railway Timetabling. [Citation Graph (, )][DBLP ] ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. [Citation Graph (, )][DBLP ] Robustness in Train Timetabling. [Citation Graph (, )][DBLP ] Repairing MIP infeasibility through local branching. [Citation Graph (, )][DBLP ] A new linear storage, polynomial-time approximation scheme for the subset-sum problem. [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.007secs