Is Binary Integer Linear Programming solvable in polynomial time?Does the independence of P = NP imply existence of arbitrarily good super-polynomial upper bound for SAT?Polynomial-time complexity and a question and a remark of SerrePartially optimal solutions in integer linear programmingIs a Parametric Integer Linear Programming Problem eventually quasi-polynomial?Under what conditions does an Integer Programming problem run in polynomial time?Feasibility Mixed integer Linear programming with quadratic constraints?Algorithm for (binary) integer programming
Is Binary Integer Linear Programming solvable in polynomial time?
Does the independence of P = NP imply existence of arbitrarily good super-polynomial upper bound for SAT?Polynomial-time complexity and a question and a remark of SerrePartially optimal solutions in integer linear programmingIs a Parametric Integer Linear Programming Problem eventually quasi-polynomial?Under what conditions does an Integer Programming problem run in polynomial time?Feasibility Mixed integer Linear programming with quadratic constraints?Algorithm for (binary) integer programming
$begingroup$
The paper Solving the Binary Linear Programming Model in Polynomial Time claims that Binary Integer Linear Programming is in P. However, it seems that no subsequent literature in the mainstream has done any further study on this. I am a bit doubtful regarding the correctness of the claim made in that paper.
Therefore, I have put this question here.
computational-complexity linear-programming integer-programming
asked 8 hours ago
aroycaroyc
1314 bronze badges
$endgroup$
add a comment |
$begingroup$
The paper Solving the Binary Linear Programming Model in Polynomial Time claims that Binary Integer Linear Programming is in P. However, it seems that no subsequent literature in the mainstream has done any further study on this. I am a bit doubtful regarding the correctness of the claim made in that paper.
Therefore, I have put this question here.
computational-complexity linear-programming integer-programming
asked 8 hours ago
aroycaroyc
1314 bronze badges
$endgroup$
add a comment |
$begingroup$
The paper Solving the Binary Linear Programming Model in Polynomial Time claims that Binary Integer Linear Programming is in P. However, it seems that no subsequent literature in the mainstream has done any further study on this. I am a bit doubtful regarding the correctness of the claim made in that paper.
Therefore, I have put this question here.
computational-complexity linear-programming integer-programming
asked 8 hours ago
aroycaroyc
1314 bronze badges
$endgroup$
The paper Solving the Binary Linear Programming Model in Polynomial Time claims that Binary Integer Linear Programming is in P. However, it seems that no subsequent literature in the mainstream has done any further study on this. I am a bit doubtful regarding the correctness of the claim made in that paper.
Therefore, I have put this question here.
computational-complexity linear-programming integer-programming
computational-complexity linear-programming integer-programming
asked 8 hours ago
aroycaroyc
1314 bronze badges
asked 8 hours ago
aroycaroyc
1314 bronze badges
asked 8 hours ago
aroycaroyc
1314 bronze badges
asked 8 hours ago
aroycaroyc
1314 bronze badges
asked 8 hours ago
aroycaroyc
1314 bronze badges
1314 bronze badges
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Often called Binary Integer Programming (BIP).
Wikipedia:
Integer programming is NP-complete. In particular, the special case of 0-1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems.
Here is a list of those 21 Karp problems.
You can also find the claim that BIP $in$ NPC in many class notes, e.g.,
this set.
answered 7 hours ago
Joseph O'RourkeJoseph O'Rourke
88k16 gold badges248 silver badges728 bronze badges
$endgroup$
4
$begingroup$
The cited paper actually acknowledges that BIP is NP-complete. In fact the paper explicitly claims to have proven that P = NP. That by itself is plenty reason to be "doubtful regarding the correctness of the claim" in the paper.
$endgroup$
– Timothy Chow
4 hours ago
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "504"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f338359%2fis-binary-integer-linear-programming-solvable-in-polynomial-time%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Often called Binary Integer Programming (BIP).
Wikipedia:
Integer programming is NP-complete. In particular, the special case of 0-1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems.
Here is a list of those 21 Karp problems.
You can also find the claim that BIP $in$ NPC in many class notes, e.g.,
this set.
answered 7 hours ago
Joseph O'RourkeJoseph O'Rourke
88k16 gold badges248 silver badges728 bronze badges
$endgroup$
4
$begingroup$
The cited paper actually acknowledges that BIP is NP-complete. In fact the paper explicitly claims to have proven that P = NP. That by itself is plenty reason to be "doubtful regarding the correctness of the claim" in the paper.
$endgroup$
– Timothy Chow
4 hours ago
add a comment |
$begingroup$
Often called Binary Integer Programming (BIP).
Wikipedia:
Integer programming is NP-complete. In particular, the special case of 0-1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems.
Here is a list of those 21 Karp problems.
You can also find the claim that BIP $in$ NPC in many class notes, e.g.,
this set.
answered 7 hours ago
Joseph O'RourkeJoseph O'Rourke
88k16 gold badges248 silver badges728 bronze badges
$endgroup$
4
$begingroup$
The cited paper actually acknowledges that BIP is NP-complete. In fact the paper explicitly claims to have proven that P = NP. That by itself is plenty reason to be "doubtful regarding the correctness of the claim" in the paper.
$endgroup$
– Timothy Chow
4 hours ago
add a comment |
$begingroup$
Often called Binary Integer Programming (BIP).
Wikipedia:
Integer programming is NP-complete. In particular, the special case of 0-1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems.
Here is a list of those 21 Karp problems.
You can also find the claim that BIP $in$ NPC in many class notes, e.g.,
this set.
answered 7 hours ago
Joseph O'RourkeJoseph O'Rourke
88k16 gold badges248 silver badges728 bronze badges
$endgroup$
Often called Binary Integer Programming (BIP).
Wikipedia:
Integer programming is NP-complete. In particular, the special case of 0-1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems.
Here is a list of those 21 Karp problems.
You can also find the claim that BIP $in$ NPC in many class notes, e.g.,
this set.
answered 7 hours ago
Joseph O'RourkeJoseph O'Rourke
88k16 gold badges248 silver badges728 bronze badges
answered 7 hours ago
Joseph O'RourkeJoseph O'Rourke
88k16 gold badges248 silver badges728 bronze badges
answered 7 hours ago
Joseph O'RourkeJoseph O'Rourke
88k16 gold badges248 silver badges728 bronze badges
answered 7 hours ago
Joseph O'RourkeJoseph O'Rourke
88k16 gold badges248 silver badges728 bronze badges
88k16 gold badges248 silver badges728 bronze badges
4
$begingroup$
The cited paper actually acknowledges that BIP is NP-complete. In fact the paper explicitly claims to have proven that P = NP. That by itself is plenty reason to be "doubtful regarding the correctness of the claim" in the paper.
$endgroup$
– Timothy Chow
4 hours ago
add a comment |
4
$begingroup$
The cited paper actually acknowledges that BIP is NP-complete. In fact the paper explicitly claims to have proven that P = NP. That by itself is plenty reason to be "doubtful regarding the correctness of the claim" in the paper.
$endgroup$
– Timothy Chow
4 hours ago
4
4
$begingroup$
The cited paper actually acknowledges that BIP is NP-complete. In fact the paper explicitly claims to have proven that P = NP. That by itself is plenty reason to be "doubtful regarding the correctness of the claim" in the paper.
$endgroup$
– Timothy Chow
4 hours ago
$begingroup$
The cited paper actually acknowledges that BIP is NP-complete. In fact the paper explicitly claims to have proven that P = NP. That by itself is plenty reason to be "doubtful regarding the correctness of the claim" in the paper.
$endgroup$
– Timothy Chow
4 hours ago
add a comment |
Thanks for contributing an answer to MathOverflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f338359%2fis-binary-integer-linear-programming-solvable-in-polynomial-time%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
