Fischetti Matteo

Matteo Fischetti

Information about the author Matteo Fischetti will soon be added to the site.
Found 49 papers in total
Frequency assignment in mobile radio systems using branch-and-cut techniques
Frequency assignment in mobile radio systems using branch-and-cut techniques
2000
We present a new exact method to plan frequency assignment for mobile radio systems in...
On the separation of maximally violated mod-k cuts
On the separation of maximally violated mod-k cuts
2000
Separation is of fundamental importance in cutting-plane based techniques for Integer...
A branch-and-cut algorithm for the symmetric generalized traveling salesman problem
A branch-and-cut algorithm for the symmetric generalized traveling salesman problem
1997
We consider a variant of the classical symmetric Traveling Salesman Problem in which...
Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control
Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control
1999
We study the problem of protecting sensitive data in a statistical two-dimensional...
Modeling and solving the crew rostering problem
Modeling and solving the crew rostering problem
1998
The Crew Rostering Problem (CRP) aims at determining an optimal sequencing of a given...
Solving the orienteering problem through branch-and-cut
Solving the orienteering problem through branch-and-cut
1998
In the Orienteering Problem (OP), we are given an undirected graph with edge weights...
Algorithms for railway crew management
Algorithms for railway crew management
1997
Crew management is concerned with building the work schedules of crews needed to cover...
On the monotonization of polyhedra
On the monotonization of polyhedra
1997
In polyhedral combinatorics one often has to analyze the facial structure of less than...
A polyhedral approach to the asymmetric traveling salesman problem
A polyhedral approach to the asymmetric traveling salesman problem
1997
Several branch-and-bound algorithms for the exact solution of the asymmetric traveling...
Odd cutsets, odd cycles and 0–1/2 Chvátal–Gomory cuts
Odd cutsets, odd cycles and 0–1/2 Chvátal–Gomory cuts
1996
We address 0–1/2 Chvátal–Gomory (C-G) cuts, a subclass of the...
{0, ½}-Chvátal–Gomory cuts
{0, ½}-Chvátal–Gomory cuts
1996
Given the integer polyhedron P I ≔ conv{x ∈ ℤ n : Ax ⩽ b} , where...
The precedence-constrained asymmetric traveling salesman polytope
The precedence-constrained asymmetric traveling salesman polytope
1995
Many applications of the traveling salesman problem require the introduction of...
A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs
A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs
1994
The authors consider the asymmetric capacitated vehicle routing problem ( CVRP ), a...
Clique tree inequalities define facets of the asymmetric traveling salesman polytope
Clique tree inequalities define facets of the asymmetric traveling salesman polytope
1995
This paper solves, in the affermative, the open question of whether the...
The delivery man problem and cumulative matroids
The delivery man problem and cumulative matroids
1993
Given a complete directed graph G=(V,A), the delivery man problem (DMP) consists of...
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets
1993
Given any family ℱ of valid inequalities for the asymmetric traveling salesman...
The Fixed-Outdegree 1-Arborescence polytope
The Fixed-Outdegree 1-Arborescence polytope
1992
A 1-arborescence is a spanning arborescence rooted at node 1, plus one arc incident...
An additive bounding procedure for the asymmetric travelling salesman problem
An additive bounding procedure for the asymmetric travelling salesman problem
1992
In this paper, new lower bounds for the asymmetric travelling salesman problem are...
Facets of two Steiner arborescence polyhedra
Facets of two Steiner arborescence polyhedra
1991
The Steiner arborescence (or Steiner directed tree) problem concerns the connection of...
Facets of the Asymmetric Traveling Salesman polytope
Facets of the Asymmetric Traveling Salesman polytope
1991
This paper considers the Asymmetric Traveling Salesman polytope, , defined as the...
On the facial structure of Steiner Arborescence polytopes
On the facial structure of Steiner Arborescence polytopes
1990
The Steiner Arborescence (or Steiner Directed Tree) Problem concerns the connection of...
Problems of ‘Bus Driver Scheduling’ and ‘Vehicle Scheduling’
Problems of ‘Bus Driver Scheduling’ and ‘Vehicle Scheduling’
1988
Problems of ‘Bus Driver Scheduling’ and ‘Vehicle Scheduling’...
The fixed job schedule problem with working-time constraints
The fixed job schedule problem with working-time constraints
1989
The authors consider a generalization of the fixed job schedule problem where a bound...
An additive bounding procedure for combinatorial optimization problems
An additive bounding procedure for combinatorial optimization problems
1989
It is known that the effectiveness of the branch-and-bound algorithms proposed for the...
Papers per page: