Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Several authors have introduced sequential relaxation techniques-based on linear and/or semi-definite programming-to generate the convex hull of 0-1 integer points in a polytope in at most n steps. ,  introduce a sequential relaxation technique, which is based on p-order cone programming (1≤p≤∞).  prove that our technique generates the convex hull of 0-1 solutions asymptotically. In addition,  show that our method generalizes and subsumes several existing methods. For example, when p=∞, our method corresponds to the ll-known procedure of Lovasz and Schrijver based on linear programming. Although the p-order cone programs in general sacrifice some strength compared to the analogous linear and semi-definite programs,  show that for p=2 they enjoy a better theoretical iteration complexity. Computational considerations of our technique are discussed.
['Samuel Burer', 'Jieqiu Chen']
I am writing a research paper on a idea A p-cone sequential relaxation procedure for 0-1 integer programs
[{"from": "human", "value": "I am writing a research paper on a idea A p-cone sequential relaxation procedure for 0-1 integer programs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Several authors have introduced sequential relaxation techniques-based on linear and/or semi-definite programming-to generate the convex hull of 0-1 integer points in a polytope in at most n steps. ,  introduce a sequential relaxation technique, which is based on p-order cone programming (1\u2264p\u2264\u221e).  prove that our technique generates the convex hull of 0-1 solutions asymptotically. In addition,  show that our method generalizes and subsumes several existing methods. For example, when p=\u221e, our method corresponds to the ll-known procedure of Lovasz and Schrijver based on linear programming. Although the p-order cone programs in general sacrifice some strength compared to the analogous linear and semi-definite programs,  show that for p=2 they enjoy a better theoretical iteration complexity. Computational considerations of our technique are discussed."}]