On Merging Cover Inequalities for Multiple Knapsack Problems
نویسندگان
چکیده
منابع مشابه
Simple lifted cover inequalities and hard knapsack problems
We consider a class of random knapsack instances described by Chvátal, who showed that with probability going to 1, such instances require an exponential number of branch-and-bound nodes. We show that even with the use of simple lifted cover inequalities, an exponential number of nodes is required with probability going to 1. It is not surprising that there exist integer programming (IP) instan...
متن کاملOn separating cover inequalities for the multidimensional knapsack problem
We propose a simple and a quite efficient separation procedure to identify cover inequalities for the multidimensional knapsack problem. It is based on the solution of a conventional integer programmingmodel. Solving this kind of integer programs is usually considered expensive and the proposed method may have been overlooked because of this assumption. The results of our experiments with a sma...
متن کاملA scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
We present an exact separation scheme for identifying most violated extended cover inequalities for application to multidimensional knapsack problems (MKP). The minimality of the resulting covers is shown to be a basic property of the criterion used for separation, namely the ratio between leftand right-hand sides of the extended cover inequality looked for. Computational results obtained on a ...
متن کاملLifting Cover Inequalities for the Binary Knapsack Polytope
We consider the family of facets of the binary knapsack polytope from minimal covers. We study previous results on sequential lifting in a unifying framework and explore a class of most violated fractional lifted cover inequalities, defined by Balas and Zemel, which are more general than traditional simple lifted cover inequalities. We investigate some theoretical properties of these inequaliti...
متن کاملSmall Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of covering type. In spite of their widespread use, these inequalities yield linear programming (LP) relaxations of exponential size, over which it is not known how to optimize exactly in polynomial time. In this paper we add...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Journal of Optimization
سال: 2015
ISSN: 2325-7105,2325-7091
DOI: 10.4236/ojop.2015.44014