Matteo Fischetti

According to our database1, Matteo Fischetti authored at least 130 papers between 1987 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Interdiction Games and Monotonicity, with Application to Knapsack Problems.
INFORMS Journal on Computing, 2019

Finding First and Most-Beautiful Queens by Integer Programming.
CoRR, 2019

Embedded hyper-parameter tuning by Simulated Annealing.
CoRR, 2019

2018
Matheuristics.
Proceedings of the Handbook of Heuristics., 2018

On the use of intersection cuts for bilevel optimization.
Math. Program., 2018

Least cost influence propagation in (social) networks.
Math. Program., 2018

A dynamic reformulation heuristic for Generalized Interdiction Problems.
European Journal of Operational Research, 2018

Faster SGD training by minibatch persistency.
CoRR, 2018

SelfSplit parallelization for mixed-integer linear programming.
Computers & OR, 2018

Deep neural networks and mixed integer linear optimization.
Constraints, 2018

Chasing First Queens by Integer Programming.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

2017
Thinning out Steiner trees: a node-based model for uniform edge costs.
Math. Program. Comput., 2017

Redesigning Benders Decomposition for Large-Scale Facility Location.
Management Science, 2017

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs.
Operations Research, 2017

Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling.
European Journal of Operational Research, 2017

Orbital shrinking: Theory and applications.
Discrete Applied Mathematics, 2017

Deep Neural Networks as 0-1 Mixed Integer Linear Programs: A Feasibility Study.
CoRR, 2017

2016
Improving branch-and-cut performance by random sampling.
Math. Program. Comput., 2016

Proximity Benders: a decomposition heuristic for stochastic programs.
J. Heuristics, 2016

Benders decomposition without separability: A computational study for capacitated facility location problems.
European Journal of Operational Research, 2016

Mixed-integer linear programming heuristics for the prepack optimization problem.
Discrete Optimization, 2016

Fast training of Support Vector Machines with Gaussian kernel.
Discrete Optimization, 2016

On handling indicator constraints in mixed integer programming.
Comp. Opt. and Appl., 2016

Intersection Cuts for Bilevel Optimization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015
MIP-and-refine matheuristic for smart grid energy management.
ITOR, 2015

2014
Boosting the feasibility pump.
Math. Program. Comput., 2014

Exploiting Erraticism in Search.
Operations Research, 2014

Proximity search for 0-1 mixed-integer convex programming.
J. Heuristics, 2014

Self-splitting of Workload in Parallel Computation.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

2013
Approximating the Split Closure.
INFORMS Journal on Computing, 2013

Backdoor Branching.
INFORMS Journal on Computing, 2013

2012
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling.
Transportation Science, 2012

Branching on nonchimerical fractionalities.
Oper. Res. Lett., 2012

Cutting plane versus compact formulations for uncertain (integer) linear programs.
Math. Program. Comput., 2012

A hard integer program made easy by lexicography.
Math. Program., 2012

Three Ideas for the Quadratic Assignment Problem.
Operations Research, 2012

Orbital Shrinking.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
A relax-and-cut framework for Gomory mixed-integer cuts.
Math. Program. Comput., 2011

Lexicography and degeneracy: can a pure cutting plane algorithm work?
Math. Program., 2011

On the separation of disjunctive cuts.
Math. Program., 2011

Backdoor Branching.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
Just MIP it!
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

A note on the selection of Benders' cuts.
Math. Program., 2010

On the enumerative nature of Gomory's dual cutting plane method.
Math. Program., 2010

Pruning Moves.
INFORMS Journal on Computing, 2010

On the knapsack closure of 0-1 Integer Linear Programs.
Electronic Notes in Discrete Mathematics, 2010

An In-Out Approach to Disjunctive Optimization.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

Towards a MIP-Cut Metascheme.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

2009
Light Robustness.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Fast Approaches to Improve the Robustness of a Railway Timetable.
Transportation Science, 2009

Feasibility pump 2.0.
Math. Program. Comput., 2009

The New Dutch Timetable: The OR Revolution.
Interfaces, 2009

Mixed-integer programming models for nesting problems.
J. Heuristics, 2009

Robustness in Train Timetabling.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Projected Chvátal-Gomory cuts for mixed integer linear programs.
Math. Program., 2008

The Linear Ordering Problem with cumulative costs.
European Journal of Operational Research, 2008

How tight is the corner relaxation?
Discrete Optimization, 2008

Repairing MIP infeasibility through local branching.
Computers & OR, 2008

Can Pure Cutting Plane Algorithms Work?.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.
Proceedings of the ATMOS 2008, 2008

ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.
Proceedings of the ATMOS 2008, 2008

2007
Mixed-Integer Cuts from Cyclic Groups.
Math. Program., 2007

Optimizing over the first Chvátal closure.
Math. Program., 2007

Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study.
INFORMS Journal on Computing, 2007

MIPping Closures: An Instant Survey.
Graphs and Combinatorics, 2007

A feasibility pump heuristic for general mixed-integer problems.
Discrete Optimization, 2007

Fast Approaches to Robust Railway Timetabling.
Proceedings of the ATMOS 2007, 2007

2006
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.
Math. Program., 2006

A new ILP-based refinement heuristic for Vehicle Routing Problems.
Math. Program., 2006

Combinatorial Benders' Cuts for Mixed-Integer Linear Programming.
Operations Research, 2006

New facets of the STS polytope generated from known facets of the ATS polytope.
Discrete Optimization, 2006

2005
The feasibility pump.
Math. Program., 2005

Reinventing Crew Scheduling at Netherlands Railways.
Interfaces, 2005

Mixed-Integer Cuts from Cyclic Groups.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Optimizing over the First Chvàtal Closure.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Solving the Prize-Collecting Steiner Tree Problem to Optimality.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem.
Networks, 2004

Combinatorial Benders' Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003
Partial cell suppression: A new methodology for statistical disclosure control.
Statistics and Computing, 2003

Local branching.
Math. Program., 2003

Optimisation of the interconnecting network of a UMTS radio mobile telephone system.
European Journal of Operational Research, 2003

2002
Exact algorithms for minimum routing cost trees.
Networks, 2002

Modeling and Solving the Train Timetabling Problem.
Operations Research, 2002

2001
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut.
Math. Program., 2001

Solving the Cell Suppression Problem on Tabular Data with Linear Constraints.
Management Science, 2001

A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems.
Management Science, 2001

Solution of Real-World Train Timetabling Problems.
Proceedings of the 34th Annual Hawaii International Conference on System Sciences (HICSS-34), 2001

Solving Real-World ATSP Instances by Branch-and-Cut.
Proceedings of the Combinatorial Optimization, 2001

2000
A polyhedral study of the asymmetric traveling salesman problem with time windows.
Networks, 2000

On the separation of maximally violated mod- k cuts.
Math. Program., 2000

Frequency assignment in mobile radio systems using branch-and-cut techniques.
European Journal of Operational Research, 2000

A polyhedral approach to an integer multicommodity flow problem.
Discrete Applied Mathematics, 2000

Algorithms for the Set Covering Problem.
Annals OR, 2000

Scheduling Train Drivers and Guards: The Dutch "Noord-Oost" Case.
Proceedings of the 33rd Annual Hawaii International Conference on System Sciences (HICSS-33), 2000

1999
Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control.
Math. Program., 1999

Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem.
Math. Oper. Res., 1999

A Heuristic Method for the Set Covering Problem.
Operations Research, 1999

On the Separation of Maximally Violated mod-k Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998
Modeling and Solving the Crew Rostering Problem.
Operations Research, 1998

Solving the Orienteering Problem through Branch-and-Cut.
INFORMS Journal on Computing, 1998

1997
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem.
Networks, 1997

Algorithms for railway crew management.
Math. Program., 1997

On the monotonization of polyhedra.
Math. Program., 1997

A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem.
Operations Research, 1997

1996
{0, 1/2}-Chvátal-Gomory cuts.
Math. Program., 1996

A Heuristic Algorithm for the Set Covering Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995
Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design.
IEEE Trans. Knowl. Data Eng., 1995

The symmetric generalized traveling salesman polytope.
Networks, 1995

The precedence-constrained asymmetric traveling salesman polytope.
Math. Program., 1995

Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope.
Discrete Applied Mathematics, 1995

1994
Weighted k-cardinality trees: Complexity and polyhedral structure.
Networks, 1994

A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs.
Operations Research, 1994

1993
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets.
Math. Program., 1993

The Delivery Man Problem and Cumulative Matroids.
Operations Research, 1993

An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs.
INFORMS Journal on Computing, 1993

On the monotonization of polyhedra.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992
An additive bounding procedure for the asymmetric travelling salesman problem.
Math. Program., 1992

The Fixed-Outdegree 1-Arborescence Polytope.
Math. Oper. Res., 1992

Approximation Algorithms for Fixed Job Schedule Problems.
Operations Research, 1992

Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991
Facts of two Steiner arborescence polyhedra.
Math. Program., 1991

Facets of the Asymmetric Traveling Salesman Polytope.
Math. Oper. Res., 1991

1990
A new linear storage, polynomial-time approximation scheme for the subset-sum problem.
Discrete Applied Mathematics, 1990

1989
A branch and bound algorithm for the multiple depot vehicle scheduling problem.
Networks, 1989

New lower bounds for the Symmetric Travelling Salesman Problem.
Math. Program., 1989

An Additive Bounding Procedure for Combinatorial Optimization Problems.
Operations Research, 1989

The Fixed Job Schedule Problem with Working-Time Constraints.
Operations Research, 1989

1987
Worst-case analysis of the differencing method for the partition problem.
Math. Program., 1987

The Fixed Job Schedule Problem with Spread-Time Constraints.
Operations Research, 1987


  Loading...