Fischetti Matteo

Matteo Fischetti

Information about the author Matteo Fischetti will soon be added to the site.
Found 49 papers in total
Redesigning Benders Decomposition for Large-Scale Facility Location
Redesigning Benders Decomposition for Large-Scale Facility Location
2017
The uncapacitated facility location (UFL) problem is one of the most famous and most...
MIP-and-refine matheuristic for smart grid energy management
MIP-and-refine matheuristic for smart grid energy management
2015
In the past years, we have witnessed an increasing interest in smart buildings, in...
Backdoor Branching
Backdoor Branching
2013
We present an exact mixed‐integer programming (MIP) solution scheme where a...
Approximating the Split Closure
Approximating the Split Closure
2013
The split closure has been proved in practice to be a very tight approximation of the...
Branching on nonchimerical fractionalities
Branching on nonchimerical fractionalities
2012
We address methods for selecting the branching variable in an enumerative algorithm...
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling
2012
Finding robust yet efficient solutions to optimization problems is a major practical...
Pruning moves
Pruning moves
2010
The concept of dominance among nodes of a branch-and-bound tree, although known for a...
Fast approaches to improve the robustness of a railway timetable
Fast approaches to improve the robustness of a railway timetable
2009
The train timetabling problem (TTP) consists of finding a train schedule on a railway...
Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
2007
Embedding cuts into a branch–and–cut framework is a delicate task,...
How tight is the corner relaxation?
How tight is the corner relaxation?
2008
Given a mixed-integer linear programming (MILP) model and an optimal basis of the...
Combinatorial Benders' cuts for mixed-integer linear programming
Combinatorial Benders' cuts for mixed-integer linear programming
2006
Mixed-integer programs (MIPs) involving logical implications modeled through big-M...
A feasibility pump heuristic for general mixed-integer problems
A feasibility pump heuristic for general mixed-integer problems
2007
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very...
New facets of the STS polytope generated from known facets of the ATS polytope
New facets of the STS polytope generated from known facets of the ATS polytope
2006
While it had been known for a long time how to transform an asymmetric traveling...
Reinventing crew scheduling at Netherlands Railways
Reinventing crew scheduling at Netherlands Railways
2005
In 2001, the 6,500+ drivers and conductors of the Dutch railway operator NS...
Optimisation of the interconnecting network of a UMTS radio mobile telephone system
Optimisation of the interconnecting network of a UMTS radio mobile telephone system
2003
In this paper we address a very important optimisation problem arising in the...
Exact algorithms for minimum routing cost trees
Exact algorithms for minimum routing cost trees
2002
Given a set of points and distances between them, a basic problem in network design...
Solving the cell suppression problem on tabular data with linear constraints
Solving the cell suppression problem on tabular data with linear constraints
2001
Cell suppression is a widely used technique for protecting sensitive information in...
A polyhedral approach to simplified crew scheduling and vehicle scheduling problems
A polyhedral approach to simplified crew scheduling and vehicle scheduling problems
2001
Crew and vehicle scheduling are fundamental issues in public transit management....
Modeling and solving the train timetabling problem
Modeling and solving the train timetabling problem
2002
The train timetabling problem aims at determining a periodic timetable for a set of...
A polyhedral study of the asymmetric traveling salesman problem with time windows
A polyhedral study of the asymmetric traveling salesman problem with time windows
2000
The asymmetric traveling salesman problem with time windows (ATSP-TW) is a basic model...
Algorithms for the set covering problem
Algorithms for the set covering problem
2000
The Set Covering Problem (SCP) is a main model for several important applications,...
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
1997
In this paper, we present a branch-and-cut algorithm for the exact solution of an...
A polyhedral approach to an integer multicommodity flow problem
A polyhedral approach to an integer multicommodity flow problem
2000
In this paper we propose a branch-and-cut algorithm for the exact solution of an...
A heuristic method for the set covering problem
A heuristic method for the set covering problem
1999
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP)....
Papers per page: