Matteo Fischetti

ORCID

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 31

Top Venues

CoRR

Eur. J. Oper. Res.

Math. Program. Comput.

INFORMS J. Comput.

Publications

Martina Fischetti, Matteo Fischetti, Jakob Stoustrup
Safe distancing in the time of COVID-19. Eur. J. Oper. Res. 304 (1) (2023)
Martina Fischetti, Matteo Fischetti
Integrated Layout and Cable Routing in Wind Farm Optimal Design. Manag. Sci. 69 (4) (2023)
Defeng Liu, Matteo Fischetti, Andrea Lodi
Learning to Search in Local Branching. AAAI (2022)
Francesco Cavaliere, Emilio Bendotti, Matteo Fischetti
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem. Math. Program. Comput. 14 (4) (2022)
Defeng Liu, Matteo Fischetti, Andrea Lodi
Learning to Search in Local Branching. CoRR (2021)
Matteo Fischetti, Matteo Stringher
Embedding Simulated Annealing within Stochastic Gradient Descent. OLA (2021)
Matteo Fischetti, Michele Monaci
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming. Eur. J. Oper. Res. 282 (2) (2020)
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
Interdiction Games and Monotonicity, with Application to Knapsack Problems. INFORMS J. Comput. 31 (2) (2019)
Matteo Fischetti, Domenico Salvagnin
Finding First and Most-Beautiful Queens by Integer Programming. CoRR (2019)
Matteo Fischetti, Matteo Stringher
Embedded hyper-parameter tuning by Simulated Annealing. CoRR (2019)
Matteo Fischetti, Iacopo Mandatelli, Domenico Salvagnin
Faster SGD training by minibatch persistency. CoRR (2018)
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
On the use of intersection cuts for bilevel optimization. Math. Program. 172 (1-2) (2018)
Matteo Fischetti, Michele Monaci, Domenico Salvagnin
SelfSplit parallelization for mixed-integer linear programming. Comput. Oper. Res. 93 (2018)
Matteo Fischetti, Domenico Salvagnin
Chasing First Queens by Integer Programming. CPAIOR (2018)
Matteo Fischetti, Michael Kahr, Markus Leitner, Michele Monaci, Mario Ruthmair
Least cost influence propagation in (social) networks. Math. Program. 170 (1) (2018)
Matteo Fischetti, Jason Jo
Deep neural networks and mixed integer linear optimization. Constraints An Int. J. 23 (3) (2018)
Matteo Fischetti, Michele Monaci, Markus Sinnl
A dynamic reformulation heuristic for Generalized Interdiction Problems. Eur. J. Oper. Res. 267 (1) (2018)
Matteo Fischetti, Michele Monaci
Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling. Eur. J. Oper. Res. 263 (1) (2017)
Matteo Fischetti, Ivana Ljubic, Markus Sinnl
Redesigning Benders Decomposition for Large-Scale Facility Location. Manag. Sci. 63 (7) (2017)
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. Oper. Res. 65 (6) (2017)
Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl
Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9 (2) (2017)
Matteo Fischetti, Leo Liberti, Domenico Salvagnin, Toby Walsh
Orbital shrinking: Theory and applications. Discret. Appl. Math. 222 (2017)
Matteo Fischetti, Jason Jo
Deep Neural Networks as 0-1 Mixed Integer Linear Programs: A Feasibility Study. CoRR (2017)
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
Intersection Cuts for Bilevel Optimization. IPCO (2016)
Natashia Boland, Matteo Fischetti, Michele Monaci, Martin W. P. Savelsbergh
Proximity Benders: a decomposition heuristic for stochastic programs. J. Heuristics 22 (2) (2016)
Matteo Fischetti, Michele Monaci, Domenico Salvagnin
Mixed-integer linear programming heuristics for the prepack optimization problem. Discret. Optim. 22 (2016)
Matteo Fischetti, Ivana Ljubic, Markus Sinnl
Benders decomposition without separability: A computational study for capacitated facility location problems. Eur. J. Oper. Res. 253 (3) (2016)
Matteo Fischetti, Andrea Lodi, Michele Monaci, Domenico Salvagnin, Andrea Tramontani
Improving branch-and-cut performance by random sampling. Math. Program. Comput. 8 (1) (2016)
Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez, Domenico Salvagnin
On handling indicator constraints in mixed integer programming. Comput. Optim. Appl. 65 (3) (2016)
Matteo Fischetti
Fast training of Support Vector Machines with Gaussian kernel. Discret. Optim. 22 (2016)
Matteo Fischetti, Giorgio Sartor, Arrigo Zanette
MIP-and-refine matheuristic for smart grid energy management. Int. Trans. Oper. Res. 22 (1) (2015)
Natashia L. Boland, Andrew C. Eberhard, Faramroze G. Engineer, Matteo Fischetti, Martin W. P. Savelsbergh, Angelos Tsoukalas
Boosting the feasibility pump. Math. Program. Comput. 6 (3) (2014)
Matteo Fischetti, Michele Monaci, Domenico Salvagnin
Self-splitting of Workload in Parallel Computation. CPAIOR (2014)
Matteo Fischetti, Michele Monaci
Proximity search for 0-1 mixed-integer convex programming. J. Heuristics 20 (6) (2014)
Matteo Fischetti, Michele Monaci
Exploiting Erraticism in Search. Oper. Res. 62 (1) (2014)
Matteo Fischetti, Michele Monaci
Backdoor Branching. INFORMS J. Comput. 25 (4) (2013)
Matteo Fischetti, Domenico Salvagnin
Approximating the Split Closure. INFORMS J. Comput. 25 (4) (2013)
Egon Balas, Matteo Fischetti, Arrigo Zanette
A hard integer program made easy by lexicography. Math. Program. 135 (1-2) (2012)
Valentina Cacchiani, Alberto Caprara, Matteo Fischetti
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling. Transp. Sci. 46 (1) (2012)
Matteo Fischetti, Michele Monaci, Domenico Salvagnin
Three Ideas for the Quadratic Assignment Problem. Oper. Res. 60 (4) (2012)
Matteo Fischetti, Michele Monaci
Branching on nonchimerical fractionalities. Oper. Res. Lett. 40 (3) (2012)
Matteo Fischetti, Leo Liberti
Orbital Shrinking. ISCO (2012)
Matteo Fischetti, Michele Monaci
Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Program. Comput. 4 (3) (2012)
Arrigo Zanette, Matteo Fischetti, Egon Balas
Lexicography and degeneracy: can a pure cutting plane algorithm work? Math. Program. 130 (1) (2011)
Matteo Fischetti, Domenico Salvagnin
A relax-and-cut framework for Gomory mixed-integer cuts. Math. Program. Comput. 3 (2) (2011)
Matteo Fischetti, Andrea Lodi, Andrea Tramontani
On the separation of disjunctive cuts. Math. Program. 128 (1-2) (2011)
Matteo Fischetti, Michele Monaci
Backdoor Branching. IPCO (2011)
Matteo Fischetti, Domenico Salvagnin
An In-Out Approach to Disjunctive Optimization. CPAIOR (2010)
Egon Balas, Matteo Fischetti, Arrigo Zanette
On the enumerative nature of Gomory's dual cutting plane method. Math. Program. 125 (2) (2010)
Matteo Fischetti
Towards a MIP-Cut Metascheme. CPAIOR (2010)
Matteo Fischetti, Domenico Salvagnin
Pruning Moves. INFORMS J. Comput. 22 (1) (2010)
Matteo Fischetti, Andrea Lodi
On the knapsack closure of 0-1 Integer Linear Programs. Electron. Notes Discret. Math. 36 (2010)
Matteo Fischetti, Domenico Salvagnin
A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts. CPAIOR (2010)
Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette
A note on the selection of Benders' cuts. Math. Program. 124 (1-2) (2010)
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) (2009)
Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette
Fast Approaches to Improve the Robustness of a Railway Timetable. Transp. Sci. 43 (3) (2009)
Matteo Fischetti, Ivan Luzzi
Mixed-integer programming models for nesting problems. J. Heuristics 15 (3) (2009)
Valentina Cacchiani, Alberto Caprara, Matteo Fischetti
Robustness in Train Timetabling. CTW (2009)
Matteo Fischetti, Domenico Salvagnin
Feasibility pump 2.0. Math. Program. Comput. 1 (2-3) (2009)
Matteo Fischetti, Andrea Lodi
Repairing MIP infeasibility through local branching. Comput. Oper. Res. 35 (5) (2008)
Matteo Fischetti, Michele Monaci
How tight is the corner relaxation? Discret. Optim. 5 (2) (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) (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)
Matteo Fischetti, Peter Widmayer
ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS (2008)
Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti
The Linear Ordering Problem with cumulative costs. Eur. J. Oper. Res. 189 (3) (2008)
Matteo Fischetti, Cristiano Saturni
Mixed-Integer Cuts from Cyclic Groups. Math. Program. 109 (1) (2007)
Giuseppe Andreello, Alberto Caprara, Matteo Fischetti
Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study. INFORMS J. Comput. 19 (2) (2007)
Matteo Fischetti, Andrea Lodi
Optimizing over the first Chvátal closure. Math. Program. 110 (1) (2007)
Matteo Fischetti, Arrigo Zanette, Domenico Salvagnin
Fast Approaches to Robust Railway Timetabling. ATMOS (2007)
Matteo Fischetti, Andrea Lodi
MIPping Closures: An Instant Survey. Graphs Comb. 23 (Supplement-1) (2007)
Livio Bertacco, Matteo Fischetti, Andrea Lodi
A feasibility pump heuristic for general mixed-integer problems. Discret. Optim. 4 (1) (2007)
Egon Balas, Robert D. Carr, Matteo Fischetti, Neil Simonetti
New facets of the STS polytope generated from known facets of the ATS polytope. Discret. Optim. 3 (1) (2006)
Gianni Codato, Matteo Fischetti
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming. Oper. Res. 54 (4) (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) (2006)
Roberto De Franceschi, Matteo Fischetti, Paolo Toth
A new ILP-based refinement heuristic for Vehicle Routing Problems. Math. Program. 105 (2-3) (2006)
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)
Matteo Fischetti, Fred W. Glover, Andrea Lodi
The feasibility pump. Math. Program. 104 (1) (2005)
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) (2005)
Matteo Fischetti, Cristiano Saturni
Mixed-Integer Cuts from Cyclic Groups. IPCO (2005)
Matteo Fischetti, Andrea Lodi
Optimizing over the First Chvàtal Closure. IPCO (2005)
Gianni Codato, Matteo Fischetti
Combinatorial Benders' Cuts. IPCO (2004)
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) (2004)
Matteo Fischetti, Giorgio Romanin-Jacur, Juan José Salazar González
Optimisation of the interconnecting network of a UMTS radio mobile telephone system. Eur. J. Oper. Res. 144 (1) (2003)
Matteo Fischetti, Andrea Lodi
Local branching. Math. Program. 98 (1-3) (2003)
Matteo Fischetti, Juan José Salazar González
Partial cell suppression: A new methodology for statistical disclosure control. Stat. Comput. 13 (1) (2003)
Alberto Caprara, Matteo Fischetti, Paolo Toth
Modeling and Solving the Train Timetabling Problem. Oper. Res. 50 (5) (2002)
Matteo Fischetti, Giuseppe Lancia, Paolo Serafini
Exact algorithms for minimum routing cost trees. Networks 39 (3) (2002)
Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth
Solution of Real-World Train Timetabling Problems. HICSS (2001)
Matteo Fischetti, Andrea Lodi, Paolo Toth
Solving Real-World ATSP Instances by Branch-and-Cut. Combinatorial Optimization (2001)
Norbert Ascheuer, Matteo Fischetti, Martin Grötschel
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut. Math. Program. 90 (3) (2001)
Matteo Fischetti, Andrea Lodi, Silvano Martello, Paolo Toth
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems. Manag. Sci. 47 (6) (2001)
Matteo Fischetti, Juan José Salazar
Solving the Cell Suppression Problem on Tabular Data with Linear Constraints. Manag. Sci. 47 (7) (2001)
Alberto Caprara, Paolo Toth, Matteo Fischetti
Algorithms for the Set Covering Problem. Ann. Oper. Res. 98 (1-4) (2000)
Norbert Ascheuer, Matteo Fischetti, Martin Grötschel
A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36 (2) (2000)
Alberto Caprara, Matteo Fischetti, Adam N. Letchford
cuts. Math. Program. 87 (1) (2000)
Lorenzo Brunetta, Michele Conforti, Matteo Fischetti
A polyhedral approach to an integer multicommodity flow problem. Discret. Appl. Math. 101 (1-3) (2000)
Matteo Fischetti, Chiara Lepschy, Giuseppe Minerva, Giorgio Romanin-Jacur, Ema Toto
Frequency assignment in mobile radio systems using branch-and-cut techniques. Eur. J. Oper. Res. 123 (2) (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)

Matteo Fischetti.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matteo Fischetti