This page shows **all publications** that appeared in the IASI annual research reports.
Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with
author names.

**
Show all publications of the year
2001, with author Rinaldi G., in the category IASI Research Reports
(or show them all):**

IASI Research Report n. 546 (Next) Eisenbrand F.,

Giovanni Rinaldi,

Paolo VenturaPrimal separation for 0/1 polytopesABSTRACT The 0/1 primal separation problem is: Given an extreme point of a 0/1 polytope P and some point ........, find an inequality which is tight at ......., violated by .....and valid for P or assert that no such inequality exists. It is known that this separation variant can be reduced to the standard separation problem for P . We show that 0/1 optimization and 0/1 primal separation are polynomial time equivalent. This implies that the problems 0/1 optimization, 0/1 standard separation, 0/1 augmentation, and 0/1 primal separation are polynomial time equivalent. Then we provide polynomial time primal separation procedures for matching, stable set, max- imum cut, and maximum bipartite graph problems, giving evidence that these algorithms are conceptually simpler and easier to implement than their corresponding counterparts for standard separation. In particular, for perfect matching we present an algorithm for primal separation that rests only on simple max-flow computations. Consequently, we obtain a very simple proof that a maximum weight perfect matching of a graph can be computed in polynomial time. In contrast, the known standard separation method involves Padberg and Rao's minimum odd cut algorithm, which itself is based on the construction of a Gomory-Hu tree.