We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times.

We analyze the process of a two cut generation scheme in the analytic center cutting plane method. We propose an optimal restoration when the two cuts are central.

In this paper we consider a new analytic center cutting plane method in a projective space. We prove the efficiency for the general scheme and show that these results can be used in the analysis of a feasability problem, the variational inequality problem and the problem if constrained...

In this paper we study special barrier functions for the convex cones, which are the sum of a self-concordant barrier for the cone and a positive-semidefinite quadratric form. We show that the central path of these augmented barrier functions can be traced with linear speed. We also study the...

A new concept is proposed for linking algebraic modeling languages and the structure exploiting solver.

In this paper we present several "infeasible-start" path-following and potential-reduction primal-dual interior-point methods for non-linear conic problems. These methods try to find a recession direction of the feasible set of a self-dual homogeneous primal-dual problem.

In this paper we study the concepts of equilibrium and optimum in static transportation networks with elastic and non-elastic demands. The main mathematical tool of our paper is the theory of variational inequalities. We demonstrate that this theory is useful for proving the existence theorems....

In this paper we consider a labor constrained scheduling problem (LCSP) which is a simplification of a practical problem arising in industry. Jobs are subject to precedence constraints and have specified processing times. Moreover, for each job the labor requirements varies as the job is...

There are many problems related to design a networks. Among them, the message routing problem plays a determinant role in the optimization of network performance. Much of the motivation of this work comes from this problem which is shown to belong to the lass of nonlinear convex multicomodity...

SETSTOCH is a tool for linking Algebraic Modeling Languages with Specialized Stochastic Programming Solvers. Its main role is to retrieve from the modeling language a dynamically ordered core model (baseline scenario) that is then sent automatically to the Stochastic Solver. The user is thus...