| 2008 |
|---|
| 37 | EE | Arrigo Zanette,
Matteo Fischetti,
Egon Balas:
Can Pure Cutting Plane Algorithms Work?.
IPCO 2008: 416-434 |
| 36 | EE | Matteo Fischetti,
Andrea Lodi:
Repairing MIP infeasibility through local branching.
Computers & OR 35(5): 1436-1445 (2008) |
| 35 | EE | 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) |
| 2007 |
|---|
| 34 | | Matteo Fischetti,
David P. Williamson:
Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings
Springer 2007 |
| 33 | EE | Matteo Fischetti,
Arrigo Zanette,
Domenico Salvagnin:
Fast Approaches to Robust Railway Timetabling.
ATMOS 2007 |
| 32 | EE | Matteo Fischetti,
Cristiano Saturni:
Mixed-Integer Cuts from Cyclic Groups.
Math. Program. 109(1): 27-53 (2007) |
| 31 | EE | Matteo Fischetti,
Andrea Lodi:
Optimizing over the first Chvátal closure.
Math. Program. 110(1): 3-20 (2007) |
| 2006 |
|---|
| 30 | EE | 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) |
| 29 | EE | 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) |
| 2005 |
|---|
| 28 | EE | 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 |
| 27 | EE | Matteo Fischetti,
Cristiano Saturni:
Mixed-Integer Cuts from Cyclic Groups.
IPCO 2005: 1-11 |
| 26 | EE | Matteo Fischetti,
Andrea Lodi:
Optimizing over the First Chvàtal Closure.
IPCO 2005: 12-22 |
| 25 | EE | Matteo Fischetti,
Fred Glover,
Andrea Lodi:
The feasibility pump.
Math. Program. 104(1): 91-104 (2005) |
| 2004 |
|---|
| 24 | EE | Gianni Codato,
Matteo Fischetti:
Combinatorial Benders' Cuts.
IPCO 2004: 178-195 |
| 23 | EE | 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) |
| 2003 |
|---|
| 22 | EE | 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) |
| 21 | EE | 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) |
| 2002 |
|---|
| 20 | EE | Matteo Fischetti,
Giuseppe Lancia,
Paolo Serafini:
Exact algorithms for minimum routing cost trees.
Networks 39(3): 161-173 (2002) |
| 2001 |
|---|
| 19 | EE | Matteo Fischetti,
Andrea Lodi,
Paolo Toth:
Solving Real-World ATSP Instances by Branch-and-Cut.
Combinatorial Optimization 2001: 64-77 |
| 18 | EE | Alberto Caprara,
Matteo Fischetti,
Pier Luigi Guida,
Michele Monaci,
Giuseppe Sacco,
Paolo Toth:
Solution of Real-World Train Timetabling Problems.
HICSS 2001 |
| 2000 |
|---|
| 17 | EE | Leo G. Kroon,
Matteo Fischetti:
Scheduling Train Drivers and Guards: The Dutch ``Noord-Oost'' Case.
HICSS 2000 |
| 16 | | Lorenzo Brunetta,
Michele Conforti,
Matteo Fischetti:
A polyhedral approach to an integer multicommodity flow problem.
Discrete Applied Mathematics 101(1-3): 13-36 (2000) |
| 15 | EE | 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) |
| 1999 |
|---|
| 14 | EE | Alberto Caprara,
Matteo Fischetti,
Adam N. Letchford:
On the Separation of Maximally Violated mod-k Cuts.
IPCO 1999: 87-98 |
| 1997 |
|---|
| 13 | | Egon Balas,
Matteo Fischetti:
On the monotonization of polyhedra.
Math. Program. 77: 59-84 (1997) |
| 12 | | Alberto Caprara,
Matteo Fischetti,
Paolo Toth,
Daniele Vigo,
Pier Luigi Guida:
Algorithms for railway crew management.
Math. Program. 79: 125-141 (1997) |
| 11 | EE | Matteo Fischetti,
Daniele Vigo:
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem.
Networks 29(1): 55-67 (1997) |
| 1996 |
|---|
| 10 | | Alberto Caprara,
Matteo Fischetti,
Paolo Toth:
A Heuristic Algorithm for the Set Covering Problem.
IPCO 1996: 72-84 |
| 9 | | Alberto Caprara,
Matteo Fischetti:
{0, 1/2}-Chvátal-Gomory cuts.
Math. Program. 74: 221-235 (1996) |
| 1995 |
|---|
| 8 | EE | Matteo Fischetti:
Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope.
Discrete Applied Mathematics 56(1): 9-18 (1995) |
| 7 | EE | 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) |
| 6 | | Egon Balas,
Matteo Fischetti,
William R. Pulleyblank:
The precedence-constrained asymmetric traveling salesman polytope.
Math. Program. 68: 241-265 (1995) |
| 1993 |
|---|
| 5 | | Egon Balas,
Matteo Fischetti:
On the monotonization of polyhedra.
IPCO 1993: 23-38 |
| 4 | | 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 |
|---|
| 3 | | Matteo Fischetti:
Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope.
IPCO 1992: 260-273 |
| 2 | | Matteo Fischetti,
Paolo Toth:
An additive bounding procedure for the asymmetric travelling salesman problem.
Math. Program. 53: 173-197 (1992) |
| 1991 |
|---|
| 1 | | Matteo Fischetti:
Facts of two Steiner arborescence polyhedra.
Math. Program. 51: 401-419 (1991) |
