Search Results

You are looking at 1 - 4 of 4 items

  • Author: A. S. ASRATYAN x
Clear All Modify Search

We use randomised rounding to obtain an upper bound for the optimum value of the program

{min cx | A xb, x0, x is an integer vector},

where b > 0, c ≥ 0 are rational vectors and A is an arbitrary rational matrix. Our bound generalises some known bounds for covering integer programs (that is, the same programs with the restriction that all elements of A are non-negative).