On polynomial complexity of a stochastic algorithm for mixed zero-one programs

Authors:
Raj Jagannathan
Affiliations:
The University of Iowa, Iowa City, IA
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 3
Cited 0

A new polynomial-time algorithm for linear programming

Combinatorica
Integer and combinatorial optimization

Integer and combinatorial optimization
Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing

Quantified Score

Hi-index	0.04

Visualization

Abstract

A stochastic (randomization) algorithm for solving mixed zero-one programs in a yes-no form is presented. Under a set of conditions, we show that any mixed zero-one program is such that either a feasible solution for the problem is obtained or it is classified as infeasible. The algorithm is such that its random running time has its kth moment, k = 1,...,j, for any j, bounded by a polynomial in n, the number of zero-one variables.