Complexity results for the gap inequalities for the max-cut problem
نویسندگان
چکیده
We prove several complexity results about the gap inequalities for the max-cut problem, including: (i) the gap-1 inequalities do not imply the other gap inequalities, unless NP = CoNP; (ii) there must exist non-redundant gap inequalities with exponentially large coefficients, unless NP = CoNP; (iii) the associated separation problem can be solved in finite (doubly exponential) time.
منابع مشابه
On the Gap Inequalities for the Max-Cut Problem
Laurent & Poljak introduced a class of valid inequalities for the max-cut problem, called gap inequalities, which include many other known inequalities as special cases. The gap inequalities have received little attention and are poorly understood. This paper presents the first ever computational results. In particular, we start presenting a cuttingplane scheme based on an effective heuristic s...
متن کاملGap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm
Laurent & Poljak introduced a class of valid inequalities for the max-cut problem, called gap inequalities, which include many other known inequalities as special cases. The gap inequalities have received little attention and are poorly understood. This paper presents the first ever computational results. In particular, we describe heuristic separation algorithms for gap inequalities and their ...
متن کاملGap inequalities for non-convex mixed-integer quadratic programs
Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general nonconvex mixed-integer quadratic programs. These inequalities dominate some inequalities arising from a natural semidefinite relaxation.
متن کاملA Note on the Integrality Gap in the Nodal Interdiction Problem
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
متن کاملGap Inequalities for the Cut Polytope
We introduce a new class of inequalities valid for the cut polytope, which we call gap inequalities. Each gap inequality is given by a nite sequence of integers, whose \gap" is deened as the smallest discrepancy arising when decomposing the sequence into two parts as equal as possible. Gap inequalities include the hypermetric inequalities and the negative type inequalities, which have been exte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 40 شماره
صفحات -
تاریخ انتشار 2012