Matteo Fischetti

Matteo Fischetti, Michele Monaci, Domenico Salvagnin: Three Ideas for the Quadratic Assignment Problem. Operations Research 60(4): 954-964 (2012)

Egon Balas, Matteo Fischetti, Arrigo Zanette: A hard integer program made easy by lexicography. Math. Program. 135(1-2): 509-514 (2012)

Matteo Fischetti, Michele Monaci: Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Program. Comput. 4(3): 239-273 (2012)

Matteo Fischetti, Michele Monaci: Branching on nonchimerical fractionalities. Oper. Res. Lett. 40(3): 159-164 (2012)

Valentina Cacchiani, Alberto Caprara, Matteo Fischetti: A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling. Transportation Science 46(1): 124-133 (2012)

Matteo Fischetti, Leo Liberti: Orbital Shrinking. ISCO 2012: 48-58

Matteo Fischetti, Andrea Lodi, Andrea Tramontani: On the separation of disjunctive cuts. Math. Program. 128(1-2): 205-230 (2011)

Arrigo Zanette, Matteo Fischetti, Egon Balas: Lexicography and degeneracy: can a pure cutting plane algorithm work? Math. Program. 130(1): 153-176 (2011)

Matteo Fischetti, Domenico Salvagnin: A relax-and-cut framework for Gomory mixed-integer cuts. Math. Program. Comput. 3(2): 79-102 (2011)

Matteo Fischetti, Michele Monaci: Backdoor Branching. IPCO 2011: 183-191

Matteo Fischetti, Andrea Lodi: On the knapsack closure of 0-1 Integer Linear Programs. Electronic Notes in Discrete Mathematics 36: 799-804 (2010)

Matteo Fischetti, Domenico Salvagnin: Pruning Moves. INFORMS Journal on Computing 22(1): 108-119 (2010)

Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette: A note on the selection of Benders' cuts. Math. Program. 124(1-2): 175-182 (2010)

Egon Balas, Matteo Fischetti, Arrigo Zanette: On the enumerative nature of Gomory's dual cutting plane method. Math. Program. 125(2): 325-351 (2010)

Matteo Fischetti: Towards a MIP-Cut Metascheme. CPAIOR 2010: 1-2

Matteo Fischetti, Domenico Salvagnin: A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts. CPAIOR 2010: 123-135

Matteo Fischetti, Domenico Salvagnin: An In-Out Approach to Disjunctive Optimization. CPAIOR 2010: 136-140

Matteo Fischetti, Andrea Lodi, Domenico Salvagnin: Just MIP it! Matheuristics 2010: 39-70

Matteo Fischetti, Ivan Luzzi: Mixed-integer programming models for nesting problems. J. Heuristics 15(3): 201-226 (2009)

Leo G. Kroon, Dennis Huisman, Erwin J. W. Abbink, Pieter-Jan Fioole, Matteo Fischetti, Gábor Maróti, Alexander Schrijver, Adri Steenbeek, Roelof Ybema: The New Dutch Timetable: The OR Revolution. Interfaces 39(1): 6-17 (2009)

Matteo Fischetti, Domenico Salvagnin: Feasibility pump 2.0. Math. Program. Comput. 1(2-3): 201-222 (2009)

Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette: Fast Approaches to Improve the Robustness of a Railway Timetable. Transportation Science 43(3): 321-335 (2009)

Valentina Cacchiani, Alberto Caprara, Matteo Fischetti: Robustness in Train Timetabling. CTW 2009: 171-174

Matteo Fischetti, Michele Monaci: Light Robustness. Robust and Online Large-Scale Optimization 2009: 61-84

Matteo Fischetti, Andrea Lodi: Repairing MIP infeasibility through local branching. Computers & OR 35(5): 1436-1445 (2008)

Matteo Fischetti, Michele Monaci: How tight is the corner relaxation? Discrete Optimization 5(2): 262-269 (2008)

Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti: The Linear Ordering Problem with cumulative costs. European Journal of Operational Research 189(3): 1345-1357 (2008)

Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi: Projected Chvátal-Gomory cuts for mixed integer linear programs. Math. Program. 113(2): 241-257 (2008)

Matteo Fischetti, Peter Widmayer: ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2008

Matteo Fischetti, Peter Widmayer: ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2008

Arrigo Zanette, Matteo Fischetti, Egon Balas: Can Pure Cutting Plane Algorithms Work?. IPCO 2008: 416-434

Matteo Fischetti, Peter Widmayer (Eds.): ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Karlsruhe, Germany, September 18, 2008. OASICS 9, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008

Livio Bertacco, Matteo Fischetti, Andrea Lodi: A feasibility pump heuristic for general mixed-integer problems. Discrete Optimization 4(1): 63-76 (2007)

Giuseppe Andreello, Alberto Caprara, Matteo Fischetti: Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study. INFORMS Journal on Computing 19(2): 229-238 (2007)

Matteo Fischetti, Cristiano Saturni: Mixed-Integer Cuts from Cyclic Groups. Math. Program. 109(1): 27-53 (2007)

Matteo Fischetti, Andrea Lodi: Optimizing over the first Chvátal closure. Math. Program. 110(1): 3-20 (2007)

Matteo Fischetti, Arrigo Zanette, Domenico Salvagnin: Fast Approaches to Robust Railway Timetabling. ATMOS 2007

Matteo Fischetti, David P. Williamson (Eds.): Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings. Lecture Notes in Computer Science 4513, Springer 2007, isbn 978-3-540-72791-0

Egon Balas, Robert Carr, Matteo Fischetti, Neil Simonetti: New facets of the STS polytope generated from known facets of the ATS polytope. Discrete Optimization 3(1): 3-19 (2006)

Gianni Codato, Matteo Fischetti: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming. Operations Research 54(4): 756-766 (2006)

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. Math. Program. 105(2-3): 427-449 (2006)

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)

Erwin J. W. Abbink, Matteo Fischetti, Leo G. Kroon, Gerrit Timmer, Michiel J. C. M. Vromans: Reinventing Crew Scheduling at Netherlands Railways. Interfaces 35(5): 393-401 (2005)

Matteo Fischetti, Fred Glover, Andrea Lodi: The feasibility pump. Math. Program. 104(1): 91-104 (2005)

Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti: Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO 2005: 68-76

Matteo Fischetti, Cristiano Saturni: Mixed-Integer Cuts from Cyclic Groups. IPCO 2005: 1-11

Matteo Fischetti, Andrea Lodi: Optimizing over the First Chvàtal Closure. IPCO 2005: 12-22

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. Networks 44(2): 61-72 (2004)

Gianni Codato, Matteo Fischetti: Combinatorial Benders' Cuts. IPCO 2004: 178-195

Matteo Fischetti, Giorgio Romanin-Jacur, Juan José Salazar González: Optimisation of the interconnecting network of a UMTS radio mobile telephone system. European Journal of Operational Research 144(1): 56-67 (2003)

Matteo Fischetti, Andrea Lodi: Local branching. Math. Program. 98(1-3): 23-47 (2003)

Matteo Fischetti, Juan José Salazar González: Partial cell suppression: A new methodology for statistical disclosure control. Statistics and Computing 13(1): 13-21 (2003)

Alberto Caprara, Matteo Fischetti, Paolo Toth: Modeling and Solving the Train Timetabling Problem. Operations Research 50(5): 851-861 (2002)

Matteo Fischetti, Giuseppe Lancia, Paolo Serafini: Exact algorithms for minimum routing cost trees. Networks 39(3): 161-173 (2002)

Matteo Fischetti, Andrea Lodi, Paolo Toth: Solving Real-World ATSP Instances by Branch-and-Cut. Combinatorial Optimization 2001: 64-77

Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth: Solution of Real-World Train Timetabling Problems. HICSS 2001

Lorenzo Brunetta, Michele Conforti, Matteo Fischetti: A polyhedral approach to an integer multicommodity flow problem. Discrete Applied Mathematics 101(1-3): 13-36 (2000)

Matteo Fischetti, Chiara Lepschy, Giuseppe Minerva, Giorgio Romanin-Jacur, Ema Toto: Frequency assignment in mobile radio systems using branch-and-cut techniques. European Journal of Operational Research 123(2): 241-255 (2000)

Norbert Ascheuer, Matteo Fischetti, Martin Grötschel: A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2): 69-79 (2000)

Leo G. Kroon, Matteo Fischetti: Scheduling Train Drivers and Guards: The Dutch ``Noord-Oost'' Case. HICSS 2000

Alberto Caprara, Matteo Fischetti, Adam N. Letchford: On the Separation of Maximally Violated mod-k Cuts. IPCO 1999: 87-98

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)

Egon Balas, Matteo Fischetti: On the monotonization of polyhedra. Math. Program. 77: 59-84 (1997)

Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida: Algorithms for railway crew management. Math. Program. 79: 125-141 (1997)

Matteo Fischetti, Daniele Vigo: A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. Networks 29(1): 55-67 (1997)

Alberto Caprara, Matteo Fischetti: {0, 1/2}-Chvátal-Gomory cuts. Math. Program. 74: 221-235 (1996)

Alberto Caprara, Matteo Fischetti, Paolo Toth: A Heuristic Algorithm for the Set Covering Problem. IPCO 1996: 72-84

Matteo Fischetti: Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope. Discrete Applied Mathematics 56(1): 9-18 (1995)

Egon Balas, Matteo Fischetti, William R. Pulleyblank: The precedence-constrained asymmetric traveling salesman polytope. Math. Program. 68: 241-265 (1995)

Matteo Fischetti, Juan José Salazar González, Paolo Toth: The symmetric generalized traveling salesman polytope. Networks 26(2): 113-123 (1995)

Alberto Caprara, Matteo Fischetti, Dario Maio: Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design. IEEE Trans. Knowl. Data Eng. 7(6): 955-967 (1995)

Matteo Fischetti, Horst W. Hamacher, Kurt Jørnsten, Francesco Maffioli: Weighted k-cardinality trees: Complexity and polyhedral structure. Networks 24(1): 11-21 (1994)

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)

Egon Balas, Matteo Fischetti: A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Math. Program. 58: 325-352 (1993)

Egon Balas, Matteo Fischetti: On the monotonization of polyhedra. IPCO 1993: 23-38

Matteo Fischetti, Paolo Toth: An additive bounding procedure for the asymmetric travelling salesman problem. Math. Program. 53: 173-197 (1992)

Matteo Fischetti: Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope. IPCO 1992: 260-273

Matteo Fischetti: Facts of two Steiner arborescence polyhedra. Math. Program. 51: 401-419 (1991)

Matteo Fischetti: A new linear storage, polynomial-time approximation scheme for the subset-sum problem. Discrete Applied Mathematics 26(1): 61-77 (1990)

Giorgio Carpaneto, Mauro Dell'Amico, Matteo Fischetti, Paolo Toth: A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks 19(5): 531-548 (1989)