Article
Licensed
Unlicensed
Requires Authentication
Analysis of randomised rounding for integer programs
-
A. S. Asratyan
Published/Copyright:
October 1, 2004
We use randomised rounding to obtain an upper bound for the optimum value of the program
{min cx | Ax ≥ b, x ≥ 0, 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).
Published Online: 2004-10-01
Published in Print: 2004-10-01
Copyright 2004, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Analysis of randomised rounding for integer programs
- Homomorphic relations of algebras with a scheme of operators
- On the connection between the eigen-vectors of weighted graphs and their subgraphs
- The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees
- Properties of systems of defining relations for automata
- Random free trees and forests with constraints on multiplicities of vertices
- On the complexity of Boolean functions with small number of ones
- A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
Articles in the same Issue
- Analysis of randomised rounding for integer programs
- Homomorphic relations of algebras with a scheme of operators
- On the connection between the eigen-vectors of weighted graphs and their subgraphs
- The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees
- Properties of systems of defining relations for automata
- Random free trees and forests with constraints on multiplicities of vertices
- On the complexity of Boolean functions with small number of ones
- A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
