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

被引：0
|
作者：
Jagannathan, R [1 ]
机构：
[1] Univ Iowa, Iowa City, IA 52242 USA
来源：
DISCRETE APPLIED MATHEMATICS | 2004年 / 134卷 / 1-3期
关键词：
mixed zero-one program; randomization method; polynomial time; probabilistic analysis; central limit theorem;
D O I：
10.1016/S0166-218X(03)00301-9
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码：91 / 103
页数：13
相关论文
共 50 条
12345