We show that for any optimal solution f for a given separable quadratic integer programming problem there exist an optimal solution ff for its cont inuous relaxation such that II :~ ff I1+o <~ nA (A)â€¦ (More)

In a recent paper Tardos described a polynomial algorithm for solving linear programming problems in which the number of arithmetic steps depends only on the size of the numbers in the constraintâ€¦ (More)

We introduce and analyze several models of schedulingn different types (groups) of jobs onm parallel machines, where in each group all jobs are identical. Our main goal is to exhibit the usefulnessâ€¦ (More)