An abstract view of symmetric gaussian elimination is presented. Problems are viewed as an assembly of computational entities whose interdependence is modeled by a graph. An algorithmic transformation on the entities which can be associated withvertex removal, is assumed to exist. The...

We consider semidefinite programs, where all the matrices defining the problem commute. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association...

We consider the problem of scheduling unrelated parallel machines subject to release dates so as to minimize the total weighted completion time of jobs. The main contribution of this paper is a probably good convex quadratic programming relaxation of strongly polynomial size of this problem.

We model the decision problems faced by the members of societies whose new members are determined by vote. We adopt a number of simplifying assumptions: the founders and the candidates are fixed; the society operates for k periods and holds elections at the beginning of each period; one vote is...

In this paper we develop new primal-dual interior-point methods for linear programming, which are based on the concept of parabolic target space. We show that such schemes work in the infinity-neighborhood of the primal-dual central path. Nevertheless these methods possess the best known...