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. This problem is NP-hard in the s...
We show that an interior-pointmethodfor monotonevariationalinequalitiesexhibits superlinear convergence provided that all the standard assumptions hold except for the well-known as...
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...