Matteo Fischetti
#166,401
Most Influential Person Now
Researcher ORCID ID = 0000-0001-6601-0568
Matteo Fischetti's AcademicInfluence.com Rankings
Matteo Fischettimathematics Degrees
Mathematics
#7530
World Rank
#10223
Historical Rank
Operations Research
#83
World Rank
#85
Historical Rank
Measure Theory
#2256
World Rank
#2705
Historical Rank
Download Badge
Mathematics
Matteo Fischetti's Degrees
- PhD Operations Research University of Milan
- Masters Mathematics University of Milan
- Bachelors Mathematics University of Milan
Similar Degrees You Can Earn
Why Is Matteo Fischetti Influential?
(Suggest an Edit or Addition)Matteo Fischetti's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Local branching (2003) (647)
- Modeling and Solving the Train Timetabling Problem (2002) (515)
- A Heuristic Method for the Set Covering Problem (1999) (461)
- Algorithms for the Set Covering Problem (2000) (428)
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (1997) (405)
- The feasibility pump (2005) (393)
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming (2006) (370)
- Solving the Orienteering Problem through Branch-and-Cut (1998) (318)
- An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem (2006) (235)
- Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut (2001) (231)
- Light Robustness (2009) (226)
- Algorithms for railway crew management (1997) (218)
- The New Dutch Timetable: The OR Revolution (2008) (191)
- The Delivery Man Problem and Cumulative Matroids (1993) (183)
- Fast Approaches to Improve the Robustness of a Railway Timetable (2009) (177)
- A feasibility pump heuristic for general mixed-integer problems (2007) (166)
- The precedence-constrained asymmetric traveling salesman polytope (1995) (163)
- Redesigning Benders Decomposition for Large-Scale Facility Location (2017) (155)
- Deep neural networks and mixed integer linear optimization (2018) (154)
- Modeling and Solving the Crew Rostering Problem (1998) (148)
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs (1994) (146)
- A branch and bound algorithm for the multiple depot vehicle scheduling problem (1989) (142)
- A note on the selection of Benders’ cuts (2010) (139)
- A polyhedral study of the asymmetric traveling salesman problem with time windows (2000) (133)
- Optimizing over the first Chvátal closure (2005) (130)
- Weighted k-cardinality trees: Complexity and polyhedral structure (1994) (125)
- A new ILP-based refinement heuristic for Vehicle Routing Problems (2006) (124)
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs (2017) (121)
- The symmetric generalized traveling salesman polytope (1995) (120)
- An Additive Bounding Procedure for Combinatorial Optimization Problems (1989) (120)
- Reinventing Crew Scheduling at Netherlands Railways (2004) (112)
- Heuristic algorithms for the multiple depot vehicle scheduling problem (1993) (112)
- Benders decomposition without separability: A computational study for capacitated facility location problems (2016) (107)
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem (1997) (105)
- A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling (2012) (101)
- The Fixed Job Schedule Problem with Spread-Time Constraints (1987) (101)
- Feasibility pump 2.0 (2009) (100)
- An additive bounding procedure for the asymmetric travelling salesman problem (1992) (98)
- Thinning out Steiner trees: a node-based model for uniform edge costs (2017) (90)
- Cutting plane versus compact formulations for uncertain (integer) linear programs (2012) (88)
- Exploiting Erraticism in Search (2014) (80)
- Proximity search for 0-1 mixed-integer convex programming (2014) (80)
- On handling indicator constraints in mixed integer programming (2016) (79)
- Deep Neural Networks as 0-1 Mixed Integer Linear Programs: A Feasibility Study (2017) (77)
- The Generalized Traveling Salesman and Orienteering Problems (2007) (77)
- Heuristics in Mixed Integer Programming (2011) (76)
- On the separation of maximally violated mod-k cuts (1999) (74)
- Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience (1999) (73)
- A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems (2001) (73)
- Mixed-integer programming models for nesting problems (2009) (69)
- A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets (1993) (68)
- Models and Algorithms for Optimizing Cell Suppression in Tabular Data with Linear Constraints (2000) (68)
- AN ADDITIVE APPROACH FOR THE OPTIMAL SOLUTION OF THE PRIZE-COLLECTING TRAVELLING SALESMAN PROBLEM. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 (1988) (65)
- Solving the Cell Suppression Problem on Tabular Data with Linear Constraints (2001) (65)
- A Heuristic Algorithm for the Set Covering Problem (1996) (63)
- On the separation of disjunctive cuts (2011) (63)
- Exact Methods for the Asymmetric Traveling Salesman Problem (2007) (62)
- The Fixed Job Schedule Problem with Working-Time Constraints (1989) (62)
- Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design (1995) (62)
- Frequency assignment in mobile radio systems using branch-and-cut techniques (2000) (59)
- Facets of the Asymmetric Traveling Salesman Polytope (1991) (59)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (2019) (59)
- Exact algorithms for minimum routing cost trees (2002) (57)
- Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study (2007) (57)
- Three Ideas for the Quadratic Assignment Problem (2012) (56)
- On the use of intersection cuts for bilevel optimization (2018) (55)
- A local branching heuristic for mixed‐integer programs with 2‐level variables, with an application to a telecommunication network design problem (2004) (54)
- Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control (1999) (54)
- Approximation Algorithms for Fixed Job Schedule Problems (1992) (49)
- Solution of real-world train timetabling problems (2001) (49)
- Projected Chvátal–Gomory cuts for mixed integer linear programs (2008) (49)
- Solving the Prize-Collecting Steiner Tree Problem to Optimality (2005) (48)
- Repairing MIP infeasibility through local branching (2008) (48)
- Lexicography and degeneracy: can a pure cutting plane algorithm work? (2011) (44)
- A polyhedral approach to an integer multicommodity flow problem (2000) (44)
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs (1993) (41)
- Intersection Cuts for Bilevel Optimization (2016) (40)
- Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling (2017) (40)
- Facets of two Steiner arborescence polyhedra (1991) (39)
- Backdoor Branching (2011) (35)
- Weighted k-cardinality trees (1992) (35)
- The Linear Ordering Problem with cumulative costs (2008) (34)
- Partial cell suppression: A new methodology for statistical disclosure control (2003) (33)
- Combinatorial Benders' Cuts (2004) (33)
- Boosting the feasibility pump (2014) (32)
- Just MIP it! (2010) (31)
- The Fixed-Outdegree 1-Arborescence Polytope (1992) (29)
- Proximity Benders: a decomposition heuristic for stochastic programs (2016) (28)
- A dynamic reformulation heuristic for Generalized Interdiction Problems (2017) (28)
- Fast training of Support Vector Machines with Gaussian kernel (2016) (28)
- Branching on nonchimerical fractionalities (2012) (27)
- Crew Scheduling for Netherlands Railways: "Destination: Customer" (2000) (27)
- On the monotonization of polyhedra (1997) (27)
- Array Designer: automated optimized array design for functional near-infrared spectroscopy (2018) (26)
- Polyhedral Theory for the Asymmetric Traveling Salesman Problem (2007) (26)
- Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope (1995) (25)
- A new dominance procedure for combinatorial optimization problems (1988) (25)
- An In-Out Approach to Disjunctive Optimization (2010) (24)
- Solving Real-World ATSP Instances by Branch-and-Cut (2001) (23)
- New lower bounds for the Symmetric Travelling Salesman Problem (1989) (23)
- MIP-and-refine matheuristic for smart grid energy management (2015) (23)
- Least cost influence propagation in (social) networks (2018) (22)
- Mixed-Integer Cuts from Cyclic Groups (2005) (22)
- A relax-and-cut framework for Gomory mixed-integer cuts (2011) (22)
- Improving branch-and-cut performance by random sampling (2016) (21)
- Orbital Shrinking (2012) (21)
- A hybrid algorithm for finding thekth smallest ofn elements in O(n) time (1988) (20)
- Crew Scheduling for Netherlands Railways (2000) (20)
- Embedding Cuts in a Branch & Cut Framework : a Computational Study with { 0 , 12 }-Cuts (2003) (20)
- Minimal Infeasible Subsystems and Benders cuts (2008) (19)
- Experiments with a multi-commodity formulation for the Symmetric Capacitated Vehicle Routing Problem (1995) (19)
- A branch-and-cut algorithm for Mixed-Integer Bilinear Programming (2019) (19)
- Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem (1999) (18)
- Self-splitting of Workload in Parallel Computation (2014) (18)
- Scheduling train drivers and guards: the Dutch "Noord-Oost" case (2000) (18)
- How tight is the corner relaxation? (2008) (17)
- Can Pure Cutting Plane Algorithms Work? (2008) (17)
- A Branch-and-Cut Algorithm for the Symmetric Generalized Travelling Salesman Problem (1995) (15)
- Worst-case analysis of the differencing method for the partition problem (1987) (15)
- Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope (1992) (15)
- Safe distancing in the time of COVID-19 (2021) (14)
- On the knapsack closure of 0-1 Integer Linear Programs (2010) (13)
- A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts (2010) (13)
- Heuristic algorithms for the Wind Farm Cable Routing problem (2020) (12)
- Pruning Moves (2010) (12)
- On the enumerative nature of Gomory’s dual cutting plane method (2010) (12)
- Interdiction Games and Monotonicity (2016) (11)
- Learning to Search in Local Branching (2022) (11)
- Approximating the Split Closure (2013) (10)
- Fast Approaches to Robust Railway Timetabling (2007) (10)
- Modeling and Solving the Cell Suppression Problem for Linearly-Constrained Tabular Data (1997) (10)
- A branch‐and‐cut algorithm for the resource‐constrained minimum‐weight arborescence problem (1997) (9)
- Embedded hyper-parameter tuning by Simulated Annealing (2019) (9)
- Mixed-integer linear programming heuristics for the prepack optimization problem (2016) (9)
- New facets of the STS polytope generated from known facets of the ATS polytope (2005) (8)
- Tree Search Stabilization by Random Sampling (2013) (8)
- Orbital shrinking: Theory and applications (2017) (6)
- Worst-case analysis of an approximation scheme for the subset-sum problem (1986) (6)
- A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem (1997) (6)
- Liquid injection to enhance biogas production in landfills for pretreated municipal solid wastes - Bio.Lea.R. project (Life+ Program). (2015) (6)
- Robustness in Train Timetabling. (2009) (6)
- Optimisation of the interconnecting network of a UMTS radio mobile telephone system (2003) (6)
- Comments on: On learning and branching: a survey (2017) (6)
- A hard integer program made easy by lexicography (2012) (5)
- Experiments with Controlled Rounding for Statistical Disclosure Control in Tabular Data with Linear (1998) (5)
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem (1989) (5)
- MIPping Closures: An Instant Survey (2007) (4)
- Optimal Turbine Allocation for Offshore and Onshore Wind Farms (2016) (3)
- On the selection of Benders ’ cuts (2010) (3)
- Faster SGD training by minibatch persistency (2018) (3)
- Thinning out facilities : a Benders decomposition approach for the uncapacitated facility location problem with separable convex costs (2015) (3)
- A Local Dominance Procedure for Mixed-Integer Linear Programming (2007) (3)
- Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings (2007) (2)
- SelfSplit parallelization for mixed-integer linear programming (2018) (2)
- ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (2008) (2)
- Chasing First Queens by Integer Programming (2018) (2)
- ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Karlsruhe, Germany, September 18, 2008 (2008) (2)
- From Mixed-Integer Linear to Mixed-Integer Bilevel Linear Programming (2017) (1)
- Geophysical Time-lapse Monitoring of Leachate Recirculation in a Bioreactor Landfill (2015) (1)
- Integrated MSW management in the Asti district (Piedmont): application of LCA to energetic and environmental issues (2007) (1)
- Revisiting local branching with a machine learning lens (2021) (1)
- Combining complete and partial cell suppression methodologies in statistical disclosure control (2001) (1)
- MIP models for MIP heuristics (2005) (1)
- A Heuristic Algorithm for Very-Large Scale Set Covering Problems (1996) (1)
- Chapter 5: Integer (Linear) Optimization (2017) (1)
- Exact and approximate Mixed-Integer Programming models for the nesting problem (2006) (1)
- Integrated Layout and Cable Routing in Wind Farm Optimal Design (2022) (1)
- Optimizing over the First Chvàtal Closure (2005) (1)
- CREW SCHEDULING AND ROSTERING PROBLEMS IN RAILWAY APPLICATIONS (1998) (0)
- Towards a MIP-Cut Metascheme (2010) (0)
- Improving branch-and-cut performance by random sampling (2015) (0)
- On the use of intersection cuts for bilevel optimization (2017) (0)
- Cutting plane versus compact formulations for uncertain (integer) linear programs (2012) (0)
- Comments on: On learning and branching: a survey (2017) (0)
- FULL SCALE USE OF LIQUID INJECTION, FOR INNOVATIVE CONTROL OF WASTE MOISTURE TO ENHANCE BIOGAS PRODUCTION IN PRE TREATED WASTE LANDFILL (BIO.LEA.R.) (2011) (0)
- A hard integer program made easy by lexicography (2011) (0)
- Proximity search heuristics for Mixed Integer Programs (2014) (0)
- Least cost influence propagation in (social) networks (2018) (0)
- Selected Papers from the 8 th Workshop on Algorithmic Approaches for Transportation Modeling , Optimization , and Systems (2008) (0)
- On handling indicator constraints in mixed integer programming (2016) (0)
- GEOPHYSICAL APPROACH FOR MONITORING A FULL SCALE USE OF LIQUID INJECTION IN PRE TREATED WASTE LANDFILL (2017) (0)
- Integrated MSW management in the district of Asti: application of LCA to energetic and environmental issues (2007) (0)
- Local Branching: Basics and Extensions (2006) (0)
- Revisiting local branching with a machine learning (2022) (0)
- Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007) (0)
- Alberto Caprara (1968-2012): Scientific Contributions (2013) (0)
- Self-split parallelization for Mixed-Integer Linear Programming (2014) (0)
- Proximity Benders: a decomposition heuristic for stochastic programs (2015) (0)
- Boosting the feasibility pump (2014) (0)
- Proximity search for 0-1 mixed-integer convex programming (2014) (0)
- Finding First and Most-Beautiful Queens by Integer Programming (2019) (0)
- Embedding Simulated Annealing within Stochastic Gradient Descent (2021) (0)
- ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (2008) (0)
- An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem (2022) (0)
- Deep neural networks and mixed integer linear optimization (2018) (0)
- Thinning out Steiner trees: a node-based model for uniform edge costs (2016) (0)
- Local Branching : Basics and Extensions 2 Prizes 6 gallimaufry 9 72 (2005) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Matteo Fischetti?
Matteo Fischetti is affiliated with the following schools:
