Alain Billionnet
ABSTRACT
Many authors have used the continuous relaxation of linear formulations of quadratic 0-1 optimization problems subject to linear constraints in order to obtain a bound of the optimal value by linear programming. But usually, optimal solutions are non-integer vectors, and thus are not feasible for the 0-1 problem. In this paper, we propose a based linear programming scheme to try to build ε-approximate polynomial time algorithms for any quadratic 0-1 maximization problems subject to linear constraints. By using this scheme, we obtain ε-approximate polynomial-time algorithms for several basic problems : the maximization of an unconstrained quadratic posiform, an assignment problem which contains k-max-cut as a particular case, k-max-cut, the k-cluster problem on bipartite graphs, and the bipartitioning problem (max-cut with a set of cardinal k).
- R. Carlson and G. Nemhauser, "Clustering to minimize interaction costs". Oper. Research Vol. 14, 1966, pp. 52--58. Google Scholar
Digital Library
- D. G. Corneil and Y. Perl, "Clustering and domination in perfect graphs". Discrete Applied Mathematics Vol. 9 (No. 1), 1984, pp. 27--39.Google ScholarCross Ref
- P. Hammer and S. Rudeanu, "Boolean methods in operations research and related areas". Springer, Berlin, Heidelberg, New York, 1968.Google Scholar
- P. Hammer, P. Hansen, and B. Simeone, "Roof duality, complementation and persistency in quadratic 0-1 optimization". Mathematical Programming, Vol. 28, 1984, pp. 121--155.Google ScholarCross Ref
- C. Papadimitriou and K. Steiglitz, "Combinatorial Optimization : Algorithms and Complexity". Prentice-Hall, Englewood Cliffs, NJ, 1982. Google ScholarDigital Library
- J. C. Picard, and M. Queyranne, "On the integer-valued variables in the linear vertex packing problem". Mathematical programming Vol. 12, 1977, pp. 97--101.Google ScholarDigital Library
- B. Simeone, "An asymptotically exact polynomial algorithm for equipartition problems". Discrete Applied Mathematics Vol. 14, 1986, pp. 283--293. Google ScholarDigital Library
- Linear programming to approximate quadratic 0-1 maximization problems
Recommendations
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem
In this paper, we consider problem (P) of minimizing a quadratic function q(x)=xtQx+ctx of binary variables. Our main idea is to use the recent Mixed Integer Quadratic Programming (MIQP) solvers. But, for this, we have to first convexify the objective ...
A note on semidefinite relaxation for 0-1 quadratic knapsack problems
the 8th International Conference on Optimization: Techniques and ApplicationsWe investigate in this note solution properties of semidefinite programming SDP relaxation for 0-1 quadratic knapsack problem QKP. In particular, we focus on the issue of uniqueness of the optimal solution to the SDP relaxation for QKP. We first give a ...
Convex Relaxations of 0, 1-Quadratic Programming
We consider three parametric relaxations of the 0, l-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. ...
Comments