dblp.uni-trier.dewww.uni-trier.de

Matteo Fischetti Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
53EEValentina Cacchiani, Alberto Caprara, Matteo Fischetti: Robustness in Train Timetabling. CTW 2009: 171-174
52EEMatteo Fischetti, Michele Monaci: Light Robustness. Robust and Online Large-Scale Optimization 2009: 61-84
51EEMatteo Fischetti, Domenico Salvagnin, Arrigo Zanette: Fast Approaches to Improve the Robustness of a Railway Timetable. Transportation Science 43(3): 321-335 (2009)
2008
50 Matteo Fischetti, Peter Widmayer: ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Karlsruhe, Germany, September 18, 2008 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
49EEMatteo Fischetti, Peter Widmayer: ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2008
48EEMatteo Fischetti, Peter Widmayer: ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2008
47EEArrigo Zanette, Matteo Fischetti, Egon Balas: Can Pure Cutting Plane Algorithms Work?. IPCO 2008: 416-434
46EEMatteo Fischetti, Andrea Lodi: Repairing MIP infeasibility through local branching. Computers & OR 35(5): 1436-1445 (2008)
45EEMatteo Fischetti, Michele Monaci: How tight is the corner relaxation? Discrete Optimization 5(2): 262-269 (2008)
44EELivio Bertacco, Lorenzo Brunetta, Matteo Fischetti: The Linear Ordering Problem with cumulative costs. European Journal of Operational Research 189(3): 1345-1357 (2008)
43EEPierre 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)
2007
42 Matteo Fischetti, David P. Williamson: Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings Springer 2007
41EEMatteo Fischetti, Arrigo Zanette, Domenico Salvagnin: Fast Approaches to Robust Railway Timetabling. ATMOS 2007
40EELivio Bertacco, Matteo Fischetti, Andrea Lodi: A feasibility pump heuristic for general mixed-integer problems. Discrete Optimization 4(1): 63-76 (2007)
39EEGiuseppe 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)
38EEMatteo Fischetti, Cristiano Saturni: Mixed-Integer Cuts from Cyclic Groups. Math. Program. 109(1): 27-53 (2007)
37EEMatteo Fischetti, Andrea Lodi: Optimizing over the first Chvátal closure. Math. Program. 110(1): 3-20 (2007)
2006
36EEEgon 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)
35EEIvana 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)
34EERoberto De Franceschi, Matteo Fischetti, Paolo Toth: A new ILP-based refinement heuristic for Vehicle Routing Problems. Math. Program. 105(2-3): 471-499 (2006)
33EEGianni Codato, Matteo Fischetti: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming. Operations Research 54(4): 756-766 (2006)
2005
32EEIvana 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
31EEMatteo Fischetti, Cristiano Saturni: Mixed-Integer Cuts from Cyclic Groups. IPCO 2005: 1-11
30EEMatteo Fischetti, Andrea Lodi: Optimizing over the First Chvàtal Closure. IPCO 2005: 12-22
29EEMatteo Fischetti, Fred Glover, Andrea Lodi: The feasibility pump. Math. Program. 104(1): 91-104 (2005)
2004
28EEGianni Codato, Matteo Fischetti: Combinatorial Benders' Cuts. IPCO 2004: 178-195
27EEMatteo 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)
2003
26EEMatteo 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)
25EEMatteo Fischetti, Juan José Salazar González: Partial cell suppression: A new methodology for statistical disclosure control. Statistics and Computing 13(1): 13-21 (2003)
2002
24EEMatteo Fischetti, Giuseppe Lancia, Paolo Serafini: Exact algorithms for minimum routing cost trees. Networks 39(3): 161-173 (2002)
23EEAlberto Caprara, Matteo Fischetti, Paolo Toth: Modeling and Solving the Train Timetabling Problem. Operations Research 50(5): 851-861 (2002)
2001
22EEMatteo Fischetti, Andrea Lodi, Paolo Toth: Solving Real-World ATSP Instances by Branch-and-Cut. Combinatorial Optimization 2001: 64-77
21EEAlberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth: Solution of Real-World Train Timetabling Problems. HICSS 2001
2000
20EELeo G. Kroon, Matteo Fischetti: Scheduling Train Drivers and Guards: The Dutch ``Noord-Oost'' Case. HICSS 2000
19 Lorenzo Brunetta, Michele Conforti, Matteo Fischetti: A polyhedral approach to an integer multicommodity flow problem. Discrete Applied Mathematics 101(1-3): 13-36 (2000)
18EENorbert Ascheuer, Matteo Fischetti, Martin Grötschel: A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2): 69-79 (2000)
1999
17EEAlberto Caprara, Matteo Fischetti, Adam N. Letchford: On the Separation of Maximally Violated mod-k Cuts. IPCO 1999: 87-98
1998
16EEMatteo 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)
1997
15 Egon Balas, Matteo Fischetti: On the monotonization of polyhedra. Math. Program. 77: 59-84 (1997)
14 Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida: Algorithms for railway crew management. Math. Program. 79: 125-141 (1997)
13EEMatteo Fischetti, Daniele Vigo: A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. Networks 29(1): 55-67 (1997)
1996
12EEAlberto Caprara, Matteo Fischetti, Paolo Toth: A Heuristic Algorithm for the Set Covering Problem. IPCO 1996: 72-84
11 Alberto Caprara, Matteo Fischetti: {0, 1/2}-Chvátal-Gomory cuts. Math. Program. 74: 221-235 (1996)
1995
10EEMatteo Fischetti: Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope. Discrete Applied Mathematics 56(1): 9-18 (1995)
9EEAlberto 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)
8 Egon Balas, Matteo Fischetti, William R. Pulleyblank: The precedence-constrained asymmetric traveling salesman polytope. Math. Program. 68: 241-265 (1995)
1993
7 Egon Balas, Matteo Fischetti: On the monotonization of polyhedra. IPCO 1993: 23-38
6EEMatteo Fischetti, Paolo Toth: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs. INFORMS Journal on Computing 5(4): 426-434 (1993)
5 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)
1992
4 Matteo Fischetti: Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope. IPCO 1992: 260-273
3 Matteo Fischetti, Paolo Toth: An additive bounding procedure for the asymmetric travelling salesman problem. Math. Program. 53: 173-197 (1992)
1991
2 Matteo Fischetti: Facts of two Steiner arborescence polyhedra. Math. Program. 51: 401-419 (1991)
1990
1EEMatteo Fischetti: A new linear storage, polynomial-time approximation scheme for the subset-sum problem. Discrete Applied Mathematics 26(1): 61-77 (1990)

Coauthor Index

1Giuseppe Andreello [39]
2Norbert Ascheuer [18]
3Egon Balas [5] [7] [8] [15] [36] [47]
4Livio Bertacco [40] [44]
5Pierre Bonami [43]
6Lorenzo Brunetta [19] [44]
7Valentina Cacchiani [53]
8Alberto Caprara [9] [11] [12] [14] [17] [21] [23] [39] [53]
9Robert Carr [36]
10Gianni Codato [28] [33]
11Michele Conforti [19]
12Gérard Cornuéjols [43]
13Sanjeeb Dash [43]
14Roberto De Franceschi [34]
15Fred Glover [29]
16Juan José Salazar González [16] [25] [26]
17Martin Grötschel [18]
18Pier Luigi Guida [14] [21]
19Gunnar W. Klau [32] [35]
20Leo G. Kroon [20]
21Giuseppe Lancia [24]
22Adam N. Letchford [17]
23Ivana Ljubic [32] [35]
24Andrea Lodi [22] [29] [30] [37] [40] [43] [46]
25Dario Maio [9]
26Michele Monaci [21] [45] [52]
27Petra Mutzel [32] [35]
28Ulrich Pferschy [32] [35]
29Carlo Polo [27]
30William R. Pulleyblank [8]
31Giorgio Romanin-Jacur [26]
32Giuseppe Sacco [21]
33Domenico Salvagnin [41] [51]
34Cristiano Saturni [31] [38]
35Massimo Scantamburlo [27]
36Paolo Serafini [24]
37Neil Simonetti [36]
38Paolo Toth [3] [6] [12] [14] [16] [21] [22] [23] [34]
39Daniele Vigo [13] [14]
40René Weiskircher [32] [35]
41Peter Widmayer [48] [49] [50]
42David P. Williamson [42]
43Arrigo Zanette [41] [47] [51]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)