Some remarks on quadratic programming with 0-1 variables
نویسندگان
چکیده
منابع مشابه
Quadratic Programming with Discrete Variables
NIE, TIANTIAN. Quadratic Programming with Discrete Variables. (Under the direction of Dr. Shu-Cherng Fang.) In this dissertation, we study the quadratic programming problem with discrete variables (DQP). DQP is important in theory and practice, but the combination of the quadratic feature of the objective function and the discrete nature of the feasible domain makes it hard to solve. In this th...
متن کامل0 Some remarks on A ( 1 ) 1 soliton cellular automata
We describe the A (1) 1 soliton cellular automata as an evolution of a poset. This allows us to explain the conservation laws for the A (1) 1 soliton cellular automata, one given by Torii, Takahashi and Satsuma, and the other given by Fukuda, Okado and Yamada, in terms of the stack permutations of states in a very natural manner. As a biproduct, we can prove a conjectured formula relating these...
متن کاملApproximating Quadratic 0-1 Programming via SOCP
We consider the problem of approximating Quadratic O-1 Integer Programs with bounded number of constraints and non-negative constraint matrix entries, which we term as PIQP. We describe and analyze a randomized algorithm based on a program with hyperbolic constraints (a Second-Order Cone Programming -SOCPformulation) that achieves an approximation ratio of O(amax n β(n)), where amax is the maxi...
متن کاملConvex Relaxations of (0, 1)-Quadratic Programming
We consider three parametric relaxations of the 0-1 quadratic programming problem. These relaxations are to: quadratic maximization over simple box constraints, quadratic maximization over the sphere, and the maximum eigenvalue of a bordered matrix. When minimized over the parameter, each of the relaxations provides an upper bound on the original discrete problem. Moreover, these bounds are eec...
متن کاملExperiments in quadratic 0-1 programming
where x e {0, 1} n, Q c ~( , , , i is an u p p e r t r i angu la r mat r ix and c c R" is a co lumn vector. Since x~-x i we can assume that the d i agona l of Q is zero. Our p r o b l e m is to find the m i n i m u m o f f This is an N P h a r d p rob lem, cf. G a r e y and Johnson (1979). It is po lynomia l ly so lvable if all the e lements of Q are nonpos i t ive , cf. P icard and Ratliff (19...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revue française d'informatique et de recherche opérationnelle. Série verte
سال: 1970
ISSN: 0376-2165
DOI: 10.1051/ro/197004v300671