A graph is called t-perfect if its stable set polytope is defined by nonnegativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect.

We express the Euler-Poincaré characteristic of a semi-algebraic set, which is the intersection of a non-singular complete intersection with two polynomial inequalities, in terms of the signatures of appropriate bilinear symmetric forms.

Solving inequalities is a very important topic in computational algebra. This paper presents a new Maple package, IneqGraphics, for displaying the two-dimensional solution sets of several inequalities of real variables. The package also deals with inequalities involving complex variables by displaying the corresponding solutions on the complex plane. The package provides graphical solutions to ...

In this paper, we consider the network loading problem under demand uncertainties with static routing, i.e, a single routing scheme based on the fraction of the demands has to be determined. We generalize the class of metric inequalities to the Γ-robust setting and show that they yield a formulation in the capacity space. We describe a polynomial time exact algorithm to separate violated robust...

We study the polyhedra of splittable and unsplittable arc sets of multicommodity ow capac-itated network design problems. We investigate the optimization problems over these polyhedra and the separation and lifting problems of valid inequalities for them. In particular, we give a linear-time separation algorithm for the residual capacity inequalities (Magnanti et al., 1993) and show that the se...

In this paper certain polynomial inequalities with restricted zeros are given, which generalize and refine some well-known due to Ankeny Rivlin, Dewan, Singh Mir, Wani Hussain others.