Matteo Fischetti

142 papers A* 1B 16C 6Journal 111Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Models and algorithms for the Time Window Assignment Traveling Salesperson Problem with stochastic travel times. Eur. J. Oper. Res. Francesco Cavaliere, Matteo Fischetti, Roberto Roberti, Domenico Salvagnin
2025	J	`jnl`	A fix-propagate-repair heuristic for mixed integer programming. Math. Program. Comput. Domenico Salvagnin, Roberto Roberti, Matteo Fischetti
2025	J	`jnl`	An improved compact formulation for the assortment optimization problem with small consideration sets. J. Oper. Res. Soc. Roberto Roberti, Domenico Salvagnin, Matteo Fischetti
2023	J	`jnl`	Integrated Layout and Cable Routing in Wind Farm Optimal Design. Manag. Sci. Martina Fischetti, Matteo Fischetti
2023	J	`jnl`	Safe distancing in the time of COVID-19. Eur. J. Oper. Res. Martina Fischetti, Matteo Fischetti, Jakob Stoustrup
2022	J	`jnl`	An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem. Math. Program. Comput. Francesco Cavaliere, Emilio Bendotti, Matteo Fischetti
2022	A*	`conf`	Learning to Search in Local Branching. AAAI Defeng Liu, Matteo Fischetti, Andrea Lodi
2021	—	`conf`	Embedding Simulated Annealing within Stochastic Gradient Descent. OLA Matteo Fischetti, Matteo Stringher
2021	J	`jnl`	Learning to Search in Local Branching. CoRR Defeng Liu, Matteo Fischetti, Andrea Lodi
2020	J	`jnl`	A branch-and-cut algorithm for Mixed-Integer Bilinear Programming. Eur. J. Oper. Res. Matteo Fischetti, Michele Monaci
2019	J	`jnl`	Embedded hyper-parameter tuning by Simulated Annealing. CoRR Matteo Fischetti, Matteo Stringher
2019	J	`jnl`	Finding First and Most-Beautiful Queens by Integer Programming. CoRR Matteo Fischetti, Domenico Salvagnin
2019	J	`jnl`	Interdiction Games and Monotonicity, with Application to Knapsack Problems. INFORMS J. Comput. Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2018	J	`jnl`	A dynamic reformulation heuristic for Generalized Interdiction Problems. Eur. J. Oper. Res. Matteo Fischetti, Michele Monaci, Markus Sinnl
2018	B	`conf`	Chasing First Queens by Integer Programming. CPAIOR Matteo Fischetti, Domenico Salvagnin
2018	J	`jnl`	Deep neural networks and mixed integer linear optimization. Constraints An Int. J. Matteo Fischetti, Jason Jo
2018	J	`jnl`	Faster SGD training by minibatch persistency. CoRR Matteo Fischetti, Iacopo Mandatelli, Domenico Salvagnin
2018	J	`jnl`	Least cost influence propagation in (social) networks. Math. Program. Matteo Fischetti, Michael Kahr, Markus Leitner, Michele Monaci, Mario Ruthmair
2018	—	`ch.`	Matheuristics. Handbook of Heuristics Martina Fischetti, Matteo Fischetti
2018	J	`jnl`	On the use of intersection cuts for bilevel optimization. Math. Program. Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2018	J	`jnl`	SelfSplit parallelization for mixed-integer linear programming. Comput. Oper. Res. Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2017	J	`jnl`	A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. Oper. Res. Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2017	J	`jnl`	Deep Neural Networks as 0-1 Mixed Integer Linear Programs: A Feasibility Study. CoRR Matteo Fischetti, Jason Jo
2017	J	`jnl`	Orbital shrinking: Theory and applications. Discret. Appl. Math. Matteo Fischetti, Leo Liberti, Domenico Salvagnin, Toby Walsh
2017	J	`jnl`	Redesigning Benders Decomposition for Large-Scale Facility Location. Manag. Sci. Matteo Fischetti, Ivana Ljubic, Markus Sinnl
2017	J	`jnl`	Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl
2017	J	`jnl`	Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling. Eur. J. Oper. Res. Matteo Fischetti, Michele Monaci
2016	J	`jnl`	Benders decomposition without separability: A computational study for capacitated facility location problems. Eur. J. Oper. Res. Matteo Fischetti, Ivana Ljubic, Markus Sinnl
2016	J	`jnl`	Fast training of Support Vector Machines with Gaussian kernel. Discret. Optim. Matteo Fischetti
2016	J	`jnl`	Improving branch-and-cut performance by random sampling. Math. Program. Comput. Matteo Fischetti, Andrea Lodi, Michele Monaci, Domenico Salvagnin, Andrea Tramontani
2016	B	`conf`	Intersection Cuts for Bilevel Optimization. IPCO Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2016	J	`jnl`	Mixed-integer linear programming heuristics for the prepack optimization problem. Discret. Optim. Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2016	J	`jnl`	On handling indicator constraints in mixed integer programming. Comput. Optim. Appl. Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez, Domenico Salvagnin
2016	J	`jnl`	Proximity Benders: a decomposition heuristic for stochastic programs. J. Heuristics Natashia Boland, Matteo Fischetti, Michele Monaci, Martin W. P. Savelsbergh
2015	J	`jnl`	MIP-and-refine matheuristic for smart grid energy management. Int. Trans. Oper. Res. Matteo Fischetti, Giorgio Sartor, Arrigo Zanette
2014	J	`jnl`	Boosting the feasibility pump. Math. Program. Comput. Natashia L. Boland, Andrew C. Eberhard, Faramroze G. Engineer, Matteo Fischetti, Martin W. P. Savelsbergh, Angelos Tsoukalas
2014	J	`jnl`	Exploiting Erraticism in Search. Oper. Res. Matteo Fischetti, Michele Monaci
2014	J	`jnl`	Proximity search for 0-1 mixed-integer convex programming. J. Heuristics Matteo Fischetti, Michele Monaci
2014	B	`conf`	Self-splitting of Workload in Parallel Computation. CPAIOR Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2013	J	`jnl`	Approximating the Split Closure. INFORMS J. Comput. Matteo Fischetti, Domenico Salvagnin
2013	J	`jnl`	Backdoor Branching. INFORMS J. Comput. Matteo Fischetti, Michele Monaci
2012	J	`jnl`	A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling. Transp. Sci. Valentina Cacchiani, Alberto Caprara, Matteo Fischetti
2012	J	`jnl`	A hard integer program made easy by lexicography. Math. Program. Egon Balas, Matteo Fischetti, Arrigo Zanette
2012	J	`jnl`	Branching on nonchimerical fractionalities. Oper. Res. Lett. Matteo Fischetti, Michele Monaci
2012	J	`jnl`	Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Program. Comput. Matteo Fischetti, Michele Monaci
2012	C	`conf`	Orbital Shrinking. ISCO Matteo Fischetti, Leo Liberti
2012	J	`jnl`	Three Ideas for the Quadratic Assignment Problem. Oper. Res. Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2011	J	`jnl`	A relax-and-cut framework for Gomory mixed-integer cuts. Math. Program. Comput. Matteo Fischetti, Domenico Salvagnin
2011	B	`conf`	Backdoor Branching. IPCO Matteo Fischetti, Michele Monaci
2011	J	`jnl`	Lexicography and degeneracy: can a pure cutting plane algorithm work? Math. Program. Arrigo Zanette, Matteo Fischetti, Egon Balas
2011	J	`jnl`	On the separation of disjunctive cuts. Math. Program. Matteo Fischetti, Andrea Lodi, Andrea Tramontani
2010	B	`conf`	A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts. CPAIOR Matteo Fischetti, Domenico Salvagnin
2010	J	`jnl`	A note on the selection of Benders' cuts. Math. Program. Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette
2010	B	`conf`	An In-Out Approach to Disjunctive Optimization. CPAIOR Matteo Fischetti, Domenico Salvagnin
2010	—	`ch.`	Just MIP it! Matheuristics Matteo Fischetti, Andrea Lodi, Domenico Salvagnin
2010	J	`jnl`	On the enumerative nature of Gomory's dual cutting plane method. Math. Program. Egon Balas, Matteo Fischetti, Arrigo Zanette
2010	J	`jnl`	On the knapsack closure of 0-1 Integer Linear Programs. Electron. Notes Discret. Math. Matteo Fischetti, Andrea Lodi
2010	J	`jnl`	Pruning Moves. INFORMS J. Comput. Matteo Fischetti, Domenico Salvagnin
2010	B	`conf`	Towards a MIP-Cut Metascheme. CPAIOR Matteo Fischetti
2009	J	`jnl`	Fast Approaches to Improve the Robustness of a Railway Timetable. Transp. Sci. Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette
2009	J	`jnl`	Feasibility pump 2.0. Math. Program. Comput. Matteo Fischetti, Domenico Salvagnin
2009	—	`ch.`	Light Robustness. Robust and Online Large-Scale Optimization Matteo Fischetti, Michele Monaci
2009	J	`jnl`	Mixed-integer programming models for nesting problems. J. Heuristics Matteo Fischetti, Ivan Luzzi
2009	C	`conf`	Robustness in Train Timetabling. CTW Valentina Cacchiani, Alberto Caprara, Matteo Fischetti
2009	J	`jnl`	The New Dutch Timetable: The OR Revolution. Interfaces Leo G. Kroon, Dennis Huisman, Erwin J. W. Abbink, Pieter-Jan Fioole, Matteo Fischetti, Gábor Maróti, Alexander Schrijver, Adri Steenbeek, Roelof Ybema
2008	C	`ed.`	8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, ATMOS 2008, Karlsruhe, Germany, September 18, 2008 ATMOS Matteo Fischetti, Peter Widmayer
2008	C	`conf`	ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS Matteo Fischetti, Peter Widmayer
2008	C	`conf`	ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS Matteo Fischetti, Peter Widmayer
2008	B	`conf`	Can Pure Cutting Plane Algorithms Work?. IPCO Arrigo Zanette, Matteo Fischetti, Egon Balas
2008	J	`jnl`	How tight is the corner relaxation? Discret. Optim. Matteo Fischetti, Michele Monaci
2008	J	`jnl`	Projected Chvátal-Gomory cuts for mixed integer linear programs. Math. Program. Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi
2008	J	`jnl`	Repairing MIP infeasibility through local branching. Comput. Oper. Res. Matteo Fischetti, Andrea Lodi
2008	J	`jnl`	The Linear Ordering Problem with cumulative costs. Eur. J. Oper. Res. Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti
2007	J	`jnl`	A feasibility pump heuristic for general mixed-integer problems. Discret. Optim. Livio Bertacco, Matteo Fischetti, Andrea Lodi
2007	J	`jnl`	Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study. INFORMS J. Comput. Giuseppe Andreello, Alberto Caprara, Matteo Fischetti
2007	C	`conf`	Fast Approaches to Robust Railway Timetabling. ATMOS Matteo Fischetti, Arrigo Zanette, Domenico Salvagnin
2007	B	`ed.`	Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings IPCO Matteo Fischetti, David P. Williamson
2007	J	`jnl`	MIPping Closures: An Instant Survey. Graphs Comb. Matteo Fischetti, Andrea Lodi
2007	J	`jnl`	Mixed-Integer Cuts from Cyclic Groups. Math. Program. Matteo Fischetti, Cristiano Saturni
2007	J	`jnl`	Optimizing over the first Chvátal closure. Math. Program. Matteo Fischetti, Andrea Lodi
2006	J	`jnl`	A new ILP-based refinement heuristic for Vehicle Routing Problems. Math. Program. Roberto De Franceschi, Matteo Fischetti, Paolo Toth
2006	J	`jnl`	An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Math. Program. Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
2006	J	`jnl`	Combinatorial Benders' Cuts for Mixed-Integer Linear Programming. Oper. Res. Gianni Codato, Matteo Fischetti
2006	J	`jnl`	New facets of the STS polytope generated from known facets of the ATS polytope. Discret. Optim. Egon Balas, Robert D. Carr, Matteo Fischetti, Neil Simonetti
2005	B	`conf`	Mixed-Integer Cuts from Cyclic Groups. IPCO Matteo Fischetti, Cristiano Saturni
2005	B	`conf`	Optimizing over the First Chvàtal Closure. IPCO Matteo Fischetti, Andrea Lodi
2005	J	`jnl`	Reinventing Crew Scheduling at Netherlands Railways. Interfaces Erwin J. W. Abbink, Matteo Fischetti, Leo G. Kroon, Gerrit Timmer, Michiel J. C. M. Vromans
2005	—	`conf`	Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
2005	J	`jnl`	The feasibility pump. Math. Program. Matteo Fischetti, Fred W. Glover, Andrea Lodi
2004	J	`jnl`	A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem. Networks Matteo Fischetti, Carlo Polo, Massimo Scantamburlo
2004	B	`conf`	Combinatorial Benders' Cuts. IPCO Gianni Codato, Matteo Fischetti
2003	J	`jnl`	Local branching. Math. Program. Matteo Fischetti, Andrea Lodi
2003	J	`jnl`	Optimisation of the interconnecting network of a UMTS radio mobile telephone system. Eur. J. Oper. Res. Matteo Fischetti, Giorgio Romanin-Jacur, Juan José Salazar González
2003	J	`jnl`	Partial cell suppression: A new methodology for statistical disclosure control. Stat. Comput. Matteo Fischetti, Juan José Salazar González
2002	J	`jnl`	Exact algorithms for minimum routing cost trees. Networks Matteo Fischetti, Giuseppe Lancia, Paolo Serafini
2002	J	`jnl`	Modeling and Solving the Train Timetabling Problem. Oper. Res. Alberto Caprara, Matteo Fischetti, Paolo Toth
2001	J	`jnl`	A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems. Manag. Sci. Matteo Fischetti, Andrea Lodi, Silvano Martello, Paolo Toth
2001	—	`conf`	Solution of Real-World Train Timetabling Problems. HICSS Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth
2001	—	`conf`	Solving Real-World ATSP Instances by Branch-and-Cut. Combinatorial Optimization Matteo Fischetti, Andrea Lodi, Paolo Toth
2001	J	`jnl`	Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut. Math. Program. Norbert Ascheuer, Matteo Fischetti, Martin Grötschel
2001	J	`jnl`	Solving the Cell Suppression Problem on Tabular Data with Linear Constraints. Manag. Sci. Matteo Fischetti, Juan José Salazar
2000	J	`jnl`	A polyhedral approach to an integer multicommodity flow problem. Discret. Appl. Math. Lorenzo Brunetta, Michele Conforti, Matteo Fischetti
2000	J	`jnl`	A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks Norbert Ascheuer, Matteo Fischetti, Martin Grötschel
2000	J	`jnl`	Algorithms for the Set Covering Problem. Ann. Oper. Res. Alberto Caprara, Paolo Toth, Matteo Fischetti
2000	J	`jnl`	Frequency assignment in mobile radio systems using branch-and-cut techniques. Eur. J. Oper. Res. Matteo Fischetti, Chiara Lepschy, Giuseppe Minerva, Giorgio Romanin-Jacur, Ema Toto
2000	J	`jnl`	On the separation of maximally violated mod- Math. Program. Alberto Caprara, Matteo Fischetti, Adam N. Letchford
2000	—	`conf`	Scheduling Train Drivers and Guards: The Dutch "Noord-Oost" Case. HICSS Leo G. Kroon, Matteo Fischetti
1999	J	`jnl`	A Heuristic Method for the Set Covering Problem. Oper. Res. Alberto Caprara, Matteo Fischetti, Paolo Toth
1999	J	`jnl`	Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem. Math. Oper. Res. Egon Balas, Matteo Fischetti
1999	J	`jnl`	Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control. Math. Program. Matteo Fischetti, Juan José Salazar
1999	B	`conf`	On the Separation of Maximally Violated mod-k Cuts. IPCO Alberto Caprara, Matteo Fischetti, Adam N. Letchford
1998	J	`jnl`	Modeling and Solving the Crew Rostering Problem. Oper. Res. Alberto Caprara, Paolo Toth, Daniele Vigo, Matteo Fischetti
1998	J	`jnl`	Solving the Orienteering Problem through Branch-and-Cut. INFORMS J. Comput. Matteo Fischetti, Juan José Salazar González, Paolo Toth
1997	J	`jnl`	A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem. Oper. Res. Matteo Fischetti, Juan José Salazar González, Paolo Toth
1997	J	`jnl`	A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. Networks Matteo Fischetti, Daniele Vigo
1997	J	`jnl`	Algorithms for railway crew management. Math. Program. Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida
1997	J	`jnl`	On the monotonization of polyhedra. Math. Program. Egon Balas, Matteo Fischetti
1996	B	`conf`	A Heuristic Algorithm for the Set Covering Problem. IPCO Alberto Caprara, Matteo Fischetti, Paolo Toth
1996	J	`jnl`	{0, 1/2}-Chvátal-Gomory cuts. Math. Program. Alberto Caprara, Matteo Fischetti
1995	J	`jnl`	Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope. Discret. Appl. Math. Matteo Fischetti
1995	J	`jnl`	Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design. IEEE Trans. Knowl. Data Eng. Alberto Caprara, Matteo Fischetti, Dario Maio
1995	J	`jnl`	The precedence-constrained asymmetric traveling salesman polytope. Math. Program. Egon Balas, Matteo Fischetti, William R. Pulleyblank
1995	J	`jnl`	The symmetric generalized traveling salesman polytope. Networks Matteo Fischetti, Juan José Salazar González, Paolo Toth
1994	J	`jnl`	A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs. Oper. Res. Matteo Fischetti, Paolo Toth, Daniele Vigo
1994	J	`jnl`	Weighted Networks Matteo Fischetti, Horst W. Hamacher, Kurt Jørnsten, Francesco Maffioli
1993	J	`jnl`	A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Math. Program. Egon Balas, Matteo Fischetti
1993	J	`jnl`	An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs. INFORMS J. Comput. Matteo Fischetti, Paolo Toth
1993	B	`conf`	On the monotonization of polyhedra. IPCO Egon Balas, Matteo Fischetti
1993	J	`jnl`	The Delivery Man Problem and Cumulative Matroids. Oper. Res. Matteo Fischetti, Gilbert Laporte, Silvano Martello
1992	J	`jnl`	An additive bounding procedure for the asymmetric travelling salesman problem. Math. Program. Matteo Fischetti, Paolo Toth
1992	J	`jnl`	Approximation Algorithms for Fixed Job Schedule Problems. Oper. Res. Matteo Fischetti, Silvano Martello, Paolo Toth
1992	J	`jnl`	The Fixed-Outdegree 1-Arborescence Polytope. Math. Oper. Res. Egon Balas, Matteo Fischetti
1992	B	`conf`	Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope. IPCO Matteo Fischetti
1991	J	`jnl`	Facets of the Asymmetric Traveling Salesman Polytope. Math. Oper. Res. Matteo Fischetti
1991	J	`jnl`	Facts of two Steiner arborescence polyhedra. Math. Program. Matteo Fischetti
1990	J	`jnl`	A new linear storage, polynomial-time approximation scheme for the subset-sum problem. Discret. Appl. Math. Matteo Fischetti
1989	J	`jnl`	A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks Giorgio Carpaneto, Mauro Dell'Amico, Matteo Fischetti, Paolo Toth
1989	J	`jnl`	An Additive Bounding Procedure for Combinatorial Optimization Problems. Oper. Res. Matteo Fischetti, Paolo Toth
1989	J	`jnl`	New lower bounds for the Symmetric Travelling Salesman Problem. Math. Program. Giorgio Carpaneto, Matteo Fischetti, Paolo Toth
1989	J	`jnl`	The Fixed Job Schedule Problem with Working-Time Constraints. Oper. Res. Matteo Fischetti, Silvano Martello, Paolo Toth
1987	J	`jnl`	The Fixed Job Schedule Problem with Spread-Time Constraints. Oper. Res. Matteo Fischetti, Silvano Martello, Paolo Toth
1987	J	`jnl`	Worst-case analysis of the differencing method for the partition problem. Math. Program. Matteo Fischetti, Silvano Martello