A linearization framework for unconstrained quadratic (0-1) problems
نویسندگان
چکیده
In this paper, we are interested in linearization techniques for exact resolution of the Unconstrained Quadratic (0-1) Problem. Our purpose is to propose ”economical” linear formulations. We first extend the current techniques in a general linearization framework containing many other schemes and propose a new linear formulation. Numerical results comparing classical, Glover’s and the new linearization are reported.
منابع مشابه
Linearization of multi-objective multi-quadratic 0-1 programming problems
A linearization technique is developed for multi-objective multi-quadratic 0-1 programming problems with linear and quadratic constraints to reduce it to multi-objective linear mixed 0-1 programming problems. The method proposed in this paper needs only O (kn) additional continuous variables where k is the number of quadratic constraints and n is the number of initial 0-1 variables.
متن کاملCompact linearization for binary quadratic problems
We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer problems subject to assignment constraints. The resulting linearized formulation is more compact and tighter than that obtained with a more usual linearization technique. We discuss the application of the compact linearizatio...
متن کاملImproved compact linearizations for the unconstrained quadratic 0-1 minimization problem
We present and compare three new compact linearizations for the quadratic 0–1 minimization problem, two of which achieve the same lower bound as does the “standard linearization”. Two of the linearizations require the same number of constraints with respect to Glover’s one, while the last one requires n additional constraints where n is the number of variables in the quadratic 0–1 problem. All ...
متن کاملA class of valid inequalities for multilinear 0-1 optimization problems
This paper investigates the polytope associated with the classical standard linearization technique for the unconstrained optimization of multilinear polynomials in 0-1 variables. A new class of valid inequalities, called 2-links, is introduced to strengthen the LP relaxation of the standard linearization. The addition of the 2-links to the standard linearization inequalities provides a complet...
متن کاملFast 2-flip move evaluations for binary unconstrained quadratic optimization problems
We provide a method for efficiently evaluating 2-flip moves that simultaneously change the values of two 0-1 variables in search methods for binary unconstrained quadratic optimization problems (UQP). We extend a framework recently proposed by the authors for creating efficient evaluations of 1-flip moves to yield a method requiring significantly less computation time than a direct sequential a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2009