The Fixed Job Schedule Problem with Spread-Time Constraints. - Matteo Fischetti; Silvano Martello; Paolo Toth (Oper. Res., 1987)

Worst-case analysis of the differencing method for the partition problem. - Matteo Fischetti; Silvano Martello (Math. Program., 1987)

The Fixed Job Schedule Problem with Working-Time Constraints. - Matteo Fischetti; Silvano Martello; Paolo Toth (Oper. Res., 1989)

An Additive Bounding Procedure for Combinatorial Optimization Problems. - Matteo Fischetti; Paolo Toth (Oper. Res., 1989)

New lower bounds for the Symmetric Travelling Salesman Problem. - Giorgio Carpaneto; Matteo Fischetti; Paolo Toth (Math. Program., 1989)

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

A new linear storage, polynomial-time approximation scheme for the subset-sum problem. - Matteo Fischetti (Discret. Appl. Math., 1990)

Facets of the Asymmetric Traveling Salesman Polytope. - Matteo Fischetti (Math. Oper. Res., 1991)

Facts of two Steiner arborescence polyhedra. - Matteo Fischetti (Math. Program., 1991)

Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope. - Matteo Fischetti (IPCO, 1992)

Approximation Algorithms for Fixed Job Schedule Problems. - Matteo Fischetti; Silvano Martello; Paolo Toth (Oper. Res., 1992)

The Fixed-Outdegree 1-Arborescence Polytope. - Egon Balas; Matteo Fischetti (Math. Oper. Res., 1992)

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

An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs. - Matteo Fischetti; Paolo Toth (INFORMS J. Comput., 1993)

The Delivery Man Problem and Cumulative Matroids. - Matteo Fischetti; Gilbert Laporte; Silvano Martello (Oper. Res., 1993)

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

A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs. - Matteo Fischetti; Paolo Toth; Daniele Vigo (Oper. Res., 1994)

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

Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope. - Matteo Fischetti (Discret. Appl. Math., 1995)

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

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

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

A Heuristic Algorithm for the Set Covering Problem. - Alberto Caprara; Matteo Fischetti; Paolo Toth (IPCO, 1996)

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

A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem. - Matteo Fischetti; Juan José Salazar González; Paolo Toth (Oper. Res., 1997)

On the monotonization of polyhedra. - Egon Balas; Matteo Fischetti (Math. Program., 1997)

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

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

Solving the Orienteering Problem through Branch-and-Cut. - Matteo Fischetti; Juan José Salazar González; Paolo Toth (INFORMS J. Comput., 1998)

Modeling and Solving the Crew Rostering Problem. - Alberto Caprara; Paolo Toth; Daniele Vigo; Matteo Fischetti (Oper. Res., 1998)

On the Separation of Maximally Violated mod-k Cuts. - Alberto Caprara; Matteo Fischetti; Adam N. Letchford (IPCO, 1999)

A Heuristic Method for the Set Covering Problem. - Alberto Caprara; Matteo Fischetti; Paolo Toth (Oper. Res., 1999)

Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem. - Egon Balas; Matteo Fischetti (Math. Oper. Res., 1999)

Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control. - Matteo Fischetti; Juan José Salazar (Math. Program., 1999)

Scheduling Train Drivers and Guards: The Dutch "Noord-Oost" Case. - Leo G. Kroon; Matteo Fischetti (HICSS, 2000)

Algorithms for the Set Covering Problem. - Alberto Caprara; Paolo Toth; Matteo Fischetti (Ann. Oper. Res., 2000)

A polyhedral approach to an integer multicommodity flow problem. - Lorenzo Brunetta; Michele Conforti; Matteo Fischetti (Discret. Appl. Math., 2000)

Frequency assignment in mobile radio systems using branch-and-cut techniques. - Matteo Fischetti; Chiara Lepschy; Giuseppe Minerva; Giorgio Romanin-Jacur; Ema Toto (Eur. J. Oper. Res., 2000)

On the separation of maximally violated mod- k cuts. - Alberto Caprara; Matteo Fischetti; Adam N. Letchford (Math. Program., 2000)

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

Solving Real-World ATSP Instances by Branch-and-Cut. - Matteo Fischetti; Andrea Lodi 001; Paolo Toth (Combinatorial Optimization, 2001)

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

A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems. - Matteo Fischetti; Andrea Lodi 001; Silvano Martello; Paolo Toth (Manag. Sci., 2001)

Solving the Cell Suppression Problem on Tabular Data with Linear Constraints. - Matteo Fischetti; Juan José Salazar (Manag. Sci., 2001)

Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut. - Norbert Ascheuer; Matteo Fischetti; Martin Grötschel (Math. Program., 2001)

Modeling and Solving the Train Timetabling Problem. - Alberto Caprara; Matteo Fischetti; Paolo Toth (Oper. Res., 2002)

Exact algorithms for minimum routing cost trees. - Matteo Fischetti; Giuseppe Lancia; Paolo Serafini (Networks, 2002)

Optimisation of the interconnecting network of a UMTS radio mobile telephone system. - Matteo Fischetti; Giorgio Romanin-Jacur; Juan José Salazar González (Eur. J. Oper. Res., 2003)

Local branching. - Matteo Fischetti; Andrea Lodi 001 (Math. Program., 2003)

Partial cell suppression: A new methodology for statistical disclosure control. - Matteo Fischetti; Juan José Salazar González (Stat. Comput., 2003)

Combinatorial Benders' Cuts. - Gianni Codato; Matteo Fischetti (IPCO, 2004)

A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem. - Matteo Fischetti; Carlo Polo; Massimo Scantamburlo (Networks, 2004)

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

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

The feasibility pump. - Matteo Fischetti; Fred W. Glover; Andrea Lodi 001 (Math. Program., 2005)

New facets of the STS polytope generated from known facets of the ATS polytope. - Egon Balas; Robert D. Carr; Matteo Fischetti; Neil Simonetti (Discret. Optim., 2006)

Combinatorial Benders' Cuts for Mixed-Integer Linear Programming. - Gianni Codato; Matteo Fischetti (Oper. Res., 2006)

A new ILP-based refinement heuristic for Vehicle Routing Problems. - Roberto De Franceschi; Matteo Fischetti; Paolo Toth (Math. Program., 2006)

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. - Ivana Ljubic; René Weiskircher; Ulrich Pferschy; Gunnar W. Klau; Petra Mutzel; Matteo Fischetti (Math. Program., 2006)

Fast Approaches to Robust Railway Timetabling. - Matteo Fischetti; Arrigo Zanette; Domenico Salvagnin (ATMOS, 2007)

A feasibility pump heuristic for general mixed-integer problems. - Livio Bertacco; Matteo Fischetti; Andrea Lodi 001 (Discret. Optim., 2007)

MIPping Closures: An Instant Survey. - Matteo Fischetti; Andrea Lodi 001 (Graphs Comb., 2007)

Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study. - Giuseppe Andreello; Alberto Caprara; Matteo Fischetti (INFORMS J. Comput., 2007)

Optimizing over the first Chvátal closure. - Matteo Fischetti; Andrea Lodi 001 (Math. Program., 2007)

Mixed-Integer Cuts from Cyclic Groups. - Matteo Fischetti; Cristiano Saturni (Math. Program., 2007)

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

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

Can Pure Cutting Plane Algorithms Work?. - Arrigo Zanette; Matteo Fischetti; Egon Balas (IPCO, 2008)

Repairing MIP infeasibility through local branching. - Matteo Fischetti; Andrea Lodi 001 (Comput. Oper. Res., 2008)

How tight is the corner relaxation? - Matteo Fischetti; Michele Monaci (Discret. Optim., 2008)

The Linear Ordering Problem with cumulative costs. - Livio Bertacco; Lorenzo Brunetta; Matteo Fischetti (Eur. J. Oper. Res., 2008)

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

Robustness in Train Timetabling. - Valentina Cacchiani; Alberto Caprara; Matteo Fischetti (CTW, 2009)

Mixed-integer programming models for nesting problems. - Matteo Fischetti; Ivan Luzzi (J. Heuristics, 2009)

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

Feasibility pump 2.0. - Matteo Fischetti; Domenico Salvagnin (Math. Program. Comput., 2009)

Fast Approaches to Improve the Robustness of a Railway Timetable. - Matteo Fischetti; Domenico Salvagnin; Arrigo Zanette (Transp. Sci., 2009)

Light Robustness. - Matteo Fischetti; Michele Monaci (Robust and Online Large-Scale Optimization, 2009)

Towards a MIP-Cut Metascheme. - Matteo Fischetti (CPAIOR, 2010)

A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts. - Matteo Fischetti; Domenico Salvagnin (CPAIOR, 2010)

An In-Out Approach to Disjunctive Optimization. - Matteo Fischetti; Domenico Salvagnin (CPAIOR, 2010)

On the knapsack closure of 0-1 Integer Linear Programs. - Matteo Fischetti; Andrea Lodi 001 (Electron. Notes Discret. Math., 2010)

Pruning Moves. - Matteo Fischetti; Domenico Salvagnin (INFORMS J. Comput., 2010)

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

A note on the selection of Benders' cuts. - Matteo Fischetti; Domenico Salvagnin; Arrigo Zanette (Math. Program., 2010)

Just MIP it! - Matteo Fischetti; Andrea Lodi 001; Domenico Salvagnin (Matheuristics, 2010)

On the separation of disjunctive cuts. - Matteo Fischetti; Andrea Lodi 001; Andrea Tramontani (Math. Program., 2011)

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

A relax-and-cut framework for Gomory mixed-integer cuts. - Matteo Fischetti; Domenico Salvagnin (Math. Program. Comput., 2011)

Orbital Shrinking. - Matteo Fischetti; Leo Liberti (ISCO, 2012)

Three Ideas for the Quadratic Assignment Problem. - Matteo Fischetti; Michele Monaci; Domenico Salvagnin (Oper. Res., 2012)

A hard integer program made easy by lexicography. - Egon Balas; Matteo Fischetti; Arrigo Zanette (Math. Program., 2012)

Cutting plane versus compact formulations for uncertain (integer) linear programs. - Matteo Fischetti; Michele Monaci (Math. Program. Comput., 2012)

Branching on nonchimerical fractionalities. - Matteo Fischetti; Michele Monaci (Oper. Res. Lett., 2012)

A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling. - Valentina Cacchiani; Alberto Caprara; Matteo Fischetti (Transp. Sci., 2012)

Backdoor Branching. - Matteo Fischetti; Michele Monaci (INFORMS J. Comput., 2013)

Approximating the Split Closure. - Matteo Fischetti; Domenico Salvagnin (INFORMS J. Comput., 2013)

Self-splitting of Workload in Parallel Computation. - Matteo Fischetti; Michele Monaci; Domenico Salvagnin (CPAIOR, 2014)

Proximity search for 0-1 mixed-integer convex programming. - Matteo Fischetti; Michele Monaci (J. Heuristics, 2014)

Exploiting Erraticism in Search. - Matteo Fischetti; Michele Monaci (Oper. Res., 2014)

Boosting the feasibility pump. - Natashia L. Boland; Andrew C. Eberhard; Faramroze G. Engineer; Matteo Fischetti; Martin W. P. Savelsbergh; Angelos Tsoukalas (Math. Program. Comput., 2014)

MIP-and-refine matheuristic for smart grid energy management. - Matteo Fischetti; Giorgio Sartor; Arrigo Zanette (Int. Trans. Oper. Res., 2015)

Intersection Cuts for Bilevel Optimization. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (IPCO, 2016)

On handling indicator constraints in mixed integer programming. - Pietro Belotti; Pierre Bonami; Matteo Fischetti; Andrea Lodi 001; Michele Monaci; Amaya Nogales-Gómez; Domenico Salvagnin (Comput. Optim. Appl., 2016)

Fast training of Support Vector Machines with Gaussian kernel. - Matteo Fischetti (Discret. Optim., 2016)

Mixed-integer linear programming heuristics for the prepack optimization problem. - Matteo Fischetti; Michele Monaci; Domenico Salvagnin (Discret. Optim., 2016)

Benders decomposition without separability: A computational study for capacitated facility location problems. - Matteo Fischetti; Ivana Ljubic; Markus Sinnl (Eur. J. Oper. Res., 2016)

Proximity Benders: a decomposition heuristic for stochastic programs. - Natashia Boland; Matteo Fischetti; Michele Monaci; Martin W. P. Savelsbergh (J. Heuristics, 2016)

Improving branch-and-cut performance by random sampling. - Matteo Fischetti; Andrea Lodi 001; Michele Monaci; Domenico Salvagnin; Andrea Tramontani (Math. Program. Comput., 2016)

Deep Neural Networks as 0-1 Mixed Integer Linear Programs: A Feasibility Study. - Matteo Fischetti; Jason Jo (CoRR, 2017)

Orbital shrinking: Theory and applications. - Matteo Fischetti; Leo Liberti; Domenico Salvagnin; Toby Walsh (Discret. Appl. Math., 2017)

Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling. - Matteo Fischetti; Michele Monaci (Eur. J. Oper. Res., 2017)

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (Oper. Res., 2017)

Redesigning Benders Decomposition for Large-Scale Facility Location. - Matteo Fischetti; Ivana Ljubic; Markus Sinnl (Manag. Sci., 2017)

Thinning out Steiner trees: a node-based model for uniform edge costs. - Matteo Fischetti; Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Michele Monaci; Max Resch; Domenico Salvagnin; Markus Sinnl (Math. Program. Comput., 2017)

Chasing First Queens by Integer Programming. - Matteo Fischetti; Domenico Salvagnin (CPAIOR, 2018)

Deep neural networks and mixed integer linear optimization. - Matteo Fischetti; Jason Jo (Constraints An Int. J., 2018)

SelfSplit parallelization for mixed-integer linear programming. - Matteo Fischetti; Michele Monaci; Domenico Salvagnin (Comput. Oper. Res., 2018)

Faster SGD training by minibatch persistency. - Matteo Fischetti; Iacopo Mandatelli; Domenico Salvagnin (CoRR, 2018)

A dynamic reformulation heuristic for Generalized Interdiction Problems. - Matteo Fischetti; Michele Monaci; Markus Sinnl (Eur. J. Oper. Res., 2018)

Least cost influence propagation in (social) networks. - Matteo Fischetti; Michael Kahr; Markus Leitner; Michele Monaci; Mario Ruthmair (Math. Program., 2018)

On the use of intersection cuts for bilevel optimization. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (Math. Program., 2018)

Matheuristics. - Martina Fischetti; Matteo Fischetti (Handbook of Heuristics, 2018)

Embedded hyper-parameter tuning by Simulated Annealing. - Matteo Fischetti; Matteo Stringher (CoRR, 2019)

Finding First and Most-Beautiful Queens by Integer Programming. - Matteo Fischetti; Domenico Salvagnin (CoRR, 2019)

Interdiction Games and Monotonicity, with Application to Knapsack Problems. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (INFORMS J. Comput., 2019)

A branch-and-cut algorithm for Mixed-Integer Bilinear Programming. - Matteo Fischetti; Michele Monaci (Eur. J. Oper. Res., 2020)

Embedding Simulated Annealing within Stochastic Gradient Descent. - Matteo Fischetti; Matteo Stringher (OLA, 2021)

Learning to Search in Local Branching. - Defeng Liu; Matteo Fischetti; Andrea Lodi 001 (AAAI, 2022)

An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem. - Francesco Cavaliere; Emilio Bendotti; Matteo Fischetti (Math. Program. Comput., 2022)

Safe distancing in the time of COVID-19. - Martina Fischetti; Matteo Fischetti; Jakob Stoustrup (Eur. J. Oper. Res., 2023)

Integrated Layout and Cable Routing in Wind Farm Optimal Design. - Martina Fischetti; Matteo Fischetti (Manag. Sci., 2023)

A fix-propagate-repair heuristic for mixed integer programming. - Domenico Salvagnin; Roberto Roberti; Matteo Fischetti (Math. Program. Comput., 2025)