Rinaldi Giovanni

Giovanni Rinaldi

Information about the author Giovanni Rinaldi will soon be added to the site.
Found 8 papers in total
The symmetric traveling salesman polytope: New facets from the graphical relaxation
The symmetric traveling salesman polytope: New facets from the graphical relaxation
2007
The path, the wheelbarrow, and the bicycle inequalities have been shown by...
Primal separation for 0/1 polytopes
Primal separation for 0/1 polytopes
2003
The 0/1 primal separation problem is: Given an extreme point &xmacr; of a 0/1 polytope...
Minimizing breaks by maximizing cuts
Minimizing breaks by maximizing cuts
2003
We propose to solve the break minimization problem in sports scheduling by...
A branch-and-cut algorithm for the equicut problem
A branch-and-cut algorithm for the equicut problem
1997
We describe an algorithm for solving the equicut problem on complete graphs. The core...
The graphical relaxation: A new framework for the symmetric traveling salesman polytope
The graphical relaxation: A new framework for the symmetric traveling salesman polytope
1993
A present trend in the study of the Symmetric Traveling Salesman Polytope ( STSP( n))...
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
1991
The graphical relaxation of the Traveling Salesman Problem is the relaxation obtained...
Facet identification for the symmetric traveling salesman polytope
Facet identification for the symmetric traveling salesman polytope
1990
Several procedures for the identification of facet inducing inequalities for the...
Scheduling tasks with sequence-dependent processing times
Scheduling tasks with sequence-dependent processing times
1988
In this article the authors consider the problem of minimizing the maximum completion...
Papers per page: