Does the problem of P vs NP come under the category of Operational Research?Computational complexity to compute an IISAlgorithmic gap for Hochbaum's (greedy) algorithm for (metric) uncapacitated facility locationAre there any efficient algorithms to solve the longest path problem in networks with cycles?When is the original BFGS algorithm still better than the Limited-Memory version?maximum eigenvalue across subsamplesModelling resource dependency in the assignment problemFinding an optimal set without forbidden subsetsDoes the “prize-collecting shortest path problem” exist?Finding minimum time for vehicle to reach to its destinationComplexity of verifying optimality in (mixed) integer programming
Return last number in sub-sequences in a list of integers
Guidelines for writing a chord progression
Why are prop blades not shaped like household fan blades?
Python π = 1 + (1/2) + (1/3) + (1/4) - (1/5) + (1/6) + (1/7) + (1/8) + (1/9) - (1/10) ...1748 Euler
"Will flex for food". What does this phrase mean?
Can I say "Gesundheit" if someone is coughing?
mv Command Deleted Files In Source Directory and Target Directory
Best Ergonomic Design for a handheld ranged weapon
A coworker mumbles to herself when working. How can I ask her to stop?
Why doesn't this proof show that the operation on a factor group is well-defined?
Gold Battle KoTH
Help me, I hate squares!
"Fewer errors means better products" or "Fewer errors mean better products"?
Does the problem of P vs NP come under the category of Operational Research?
How to crop this photo of water drops on a leaf to improve the composition?
Is this popular optical illusion made of a grey-scale image with coloured lines?
Is the EU really banning "toxic propellants" in 2020? How is that going to work?
Applying for mortgage when living together but only one will be on the mortgage
Difference between HCD and CID collision induced dissociations?
Password management for kids - what's a good way to start?
Should I put my name first or last in the team members list?
May a hotel provide accommodation for fewer people than booked?
Adding a (stair/baby) gate without facing walls
How to derive trigonometric Cartesian equation from parametric
Does the problem of P vs NP come under the category of Operational Research?
Computational complexity to compute an IISAlgorithmic gap for Hochbaum's (greedy) algorithm for (metric) uncapacitated facility locationAre there any efficient algorithms to solve the longest path problem in networks with cycles?When is the original BFGS algorithm still better than the Limited-Memory version?maximum eigenvalue across subsamplesModelling resource dependency in the assignment problemFinding an optimal set without forbidden subsetsDoes the “prize-collecting shortest path problem” exist?Finding minimum time for vehicle to reach to its destinationComplexity of verifying optimality in (mixed) integer programming
$begingroup$
I am enrolled in an Operational Research program. I am also interested in Algorithms, and I wish to know whether "P vs NP" is a common point in both of the fields, so that the effort put in understanding this problem forwards me in both directions.
algorithms computational-complexity open-problems
edited 7 hours ago
Marco Lübbecke
2,0983 silver badges27 bronze badges
asked 8 hours ago
Vikranth IntiVikranth Inti
192 bronze badges
New contributor
Vikranth Inti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I am enrolled in an Operational Research program. I am also interested in Algorithms, and I wish to know whether "P vs NP" is a common point in both of the fields, so that the effort put in understanding this problem forwards me in both directions.
algorithms computational-complexity open-problems
edited 7 hours ago
Marco Lübbecke
2,0983 silver badges27 bronze badges
asked 8 hours ago
Vikranth IntiVikranth Inti
192 bronze badges
New contributor
Vikranth Inti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
X-posted: math.stackexchange.com/q/3310472/339790
$endgroup$
– Rodrigo de Azevedo
50 mins ago
add a comment |
$begingroup$
I am enrolled in an Operational Research program. I am also interested in Algorithms, and I wish to know whether "P vs NP" is a common point in both of the fields, so that the effort put in understanding this problem forwards me in both directions.
algorithms computational-complexity open-problems
edited 7 hours ago
Marco Lübbecke
2,0983 silver badges27 bronze badges
asked 8 hours ago
Vikranth IntiVikranth Inti
192 bronze badges
New contributor
Vikranth Inti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I am enrolled in an Operational Research program. I am also interested in Algorithms, and I wish to know whether "P vs NP" is a common point in both of the fields, so that the effort put in understanding this problem forwards me in both directions.
algorithms computational-complexity open-problems
algorithms computational-complexity open-problems
edited 7 hours ago
Marco Lübbecke
2,0983 silver badges27 bronze badges
asked 8 hours ago
Vikranth IntiVikranth Inti
192 bronze badges
New contributor
Vikranth Inti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 7 hours ago
Marco Lübbecke
2,0983 silver badges27 bronze badges
asked 8 hours ago
Vikranth IntiVikranth Inti
192 bronze badges
New contributor
Vikranth Inti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 7 hours ago
Marco Lübbecke
2,0983 silver badges27 bronze badges
edited 7 hours ago
Marco Lübbecke
2,0983 silver badges27 bronze badges
edited 7 hours ago
Marco Lübbecke
2,0983 silver badges27 bronze badges
2,0983 silver badges27 bronze badges
asked 8 hours ago
Vikranth IntiVikranth Inti
192 bronze badges
New contributor
Vikranth Inti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 8 hours ago
Vikranth IntiVikranth Inti
192 bronze badges
asked 8 hours ago
Vikranth IntiVikranth Inti
192 bronze badges
192 bronze badges
New contributor
Vikranth Inti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Vikranth Inti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$begingroup$
X-posted: math.stackexchange.com/q/3310472/339790
$endgroup$
– Rodrigo de Azevedo
50 mins ago
add a comment |
$begingroup$
X-posted: math.stackexchange.com/q/3310472/339790
$endgroup$
– Rodrigo de Azevedo
50 mins ago
$begingroup$
X-posted: math.stackexchange.com/q/3310472/339790
$endgroup$
– Rodrigo de Azevedo
50 mins ago
$begingroup$
X-posted: math.stackexchange.com/q/3310472/339790
$endgroup$
– Rodrigo de Azevedo
50 mins ago
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
The short answer is yes, operations researchers care a lot about P vs NP. We deal in algorithms, and the complexity of those algorithms matters a lot to us.
The title of your question suggests you are asking whether P-vs-NP is contained within OR (although the body of your question does not). I would not say that P-vs-NP is contained within OR; rather, it is a topic that is of interest to operations researchers, computer scientists, mathematicians, and others.
answered 8 hours ago
LarrySnyder610LarrySnyder610
4,68311 silver badges59 bronze badges
$endgroup$
add a comment |
$begingroup$
I can't help pointing to the traveling salesman movie.
answered 7 hours ago
Marco LübbeckeMarco Lübbecke
2,0983 silver badges27 bronze badges
$endgroup$
add a comment |
$begingroup$
P vs. NP may come "under" the category of Operational Research (O.R.). But unlike theoretical computer science and algorithm analysis, in which P vs. NP may be a be all and end all, practical (non-academic) O.R. people are not necessarily fixated on it.
In some circles, NP Hard is essentially considered to mean unsolvable. However, there are several commercial MILP (Mixed Integer Linear Programming) vendors whose entire business model is predicated on the ability and success of their customers to routinely solve NP Hard problems of practical business significance - that is O.R. in action.
answered 7 hours ago
Mark L. StoneMark L. Stone
2,8876 silver badges26 bronze badges
$endgroup$
add a comment |
$begingroup$
As mentioned by others, OR is definitely involved in the P vs. NP issue. If you can find a polynomial time algorithm to solve the Quadratic Assignment Problem or the TSP which Marco mentioned, both of which are essentially OR problems, then you can say P = NP.
But, the P vs. NP issue is not strictly “under” OR because there are other fields which are closely intertwined with the “debate” (pure math, applied math, computer science).
answered 7 hours ago
dxbdxb
5531 silver badge13 bronze badges
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "700"
;
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
);
);
Vikranth Inti is a new contributor. Be nice, and check out our Code of Conduct.
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%2for.stackexchange.com%2fquestions%2f1132%2fdoes-the-problem-of-p-vs-np-come-under-the-category-of-operational-research%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The short answer is yes, operations researchers care a lot about P vs NP. We deal in algorithms, and the complexity of those algorithms matters a lot to us.
The title of your question suggests you are asking whether P-vs-NP is contained within OR (although the body of your question does not). I would not say that P-vs-NP is contained within OR; rather, it is a topic that is of interest to operations researchers, computer scientists, mathematicians, and others.
answered 8 hours ago
LarrySnyder610LarrySnyder610
4,68311 silver badges59 bronze badges
$endgroup$
add a comment |
$begingroup$
The short answer is yes, operations researchers care a lot about P vs NP. We deal in algorithms, and the complexity of those algorithms matters a lot to us.
The title of your question suggests you are asking whether P-vs-NP is contained within OR (although the body of your question does not). I would not say that P-vs-NP is contained within OR; rather, it is a topic that is of interest to operations researchers, computer scientists, mathematicians, and others.
answered 8 hours ago
LarrySnyder610LarrySnyder610
4,68311 silver badges59 bronze badges
$endgroup$
add a comment |
$begingroup$
The short answer is yes, operations researchers care a lot about P vs NP. We deal in algorithms, and the complexity of those algorithms matters a lot to us.
The title of your question suggests you are asking whether P-vs-NP is contained within OR (although the body of your question does not). I would not say that P-vs-NP is contained within OR; rather, it is a topic that is of interest to operations researchers, computer scientists, mathematicians, and others.
answered 8 hours ago
LarrySnyder610LarrySnyder610
4,68311 silver badges59 bronze badges
$endgroup$
The short answer is yes, operations researchers care a lot about P vs NP. We deal in algorithms, and the complexity of those algorithms matters a lot to us.
The title of your question suggests you are asking whether P-vs-NP is contained within OR (although the body of your question does not). I would not say that P-vs-NP is contained within OR; rather, it is a topic that is of interest to operations researchers, computer scientists, mathematicians, and others.
answered 8 hours ago
LarrySnyder610LarrySnyder610
4,68311 silver badges59 bronze badges
answered 8 hours ago
LarrySnyder610LarrySnyder610
4,68311 silver badges59 bronze badges
answered 8 hours ago
LarrySnyder610LarrySnyder610
4,68311 silver badges59 bronze badges
answered 8 hours ago
LarrySnyder610LarrySnyder610
4,68311 silver badges59 bronze badges
4,68311 silver badges59 bronze badges
add a comment |
add a comment |
$begingroup$
I can't help pointing to the traveling salesman movie.
answered 7 hours ago
Marco LübbeckeMarco Lübbecke
2,0983 silver badges27 bronze badges
$endgroup$
add a comment |
$begingroup$
I can't help pointing to the traveling salesman movie.
answered 7 hours ago
Marco LübbeckeMarco Lübbecke
2,0983 silver badges27 bronze badges
$endgroup$
add a comment |
$begingroup$
I can't help pointing to the traveling salesman movie.
answered 7 hours ago
Marco LübbeckeMarco Lübbecke
2,0983 silver badges27 bronze badges
$endgroup$
I can't help pointing to the traveling salesman movie.
answered 7 hours ago
Marco LübbeckeMarco Lübbecke
2,0983 silver badges27 bronze badges
answered 7 hours ago
Marco LübbeckeMarco Lübbecke
2,0983 silver badges27 bronze badges
answered 7 hours ago
Marco LübbeckeMarco Lübbecke
2,0983 silver badges27 bronze badges
answered 7 hours ago
Marco LübbeckeMarco Lübbecke
2,0983 silver badges27 bronze badges
2,0983 silver badges27 bronze badges
add a comment |
add a comment |
$begingroup$
P vs. NP may come "under" the category of Operational Research (O.R.). But unlike theoretical computer science and algorithm analysis, in which P vs. NP may be a be all and end all, practical (non-academic) O.R. people are not necessarily fixated on it.
In some circles, NP Hard is essentially considered to mean unsolvable. However, there are several commercial MILP (Mixed Integer Linear Programming) vendors whose entire business model is predicated on the ability and success of their customers to routinely solve NP Hard problems of practical business significance - that is O.R. in action.
answered 7 hours ago
Mark L. StoneMark L. Stone
2,8876 silver badges26 bronze badges
$endgroup$
add a comment |
$begingroup$
P vs. NP may come "under" the category of Operational Research (O.R.). But unlike theoretical computer science and algorithm analysis, in which P vs. NP may be a be all and end all, practical (non-academic) O.R. people are not necessarily fixated on it.
In some circles, NP Hard is essentially considered to mean unsolvable. However, there are several commercial MILP (Mixed Integer Linear Programming) vendors whose entire business model is predicated on the ability and success of their customers to routinely solve NP Hard problems of practical business significance - that is O.R. in action.
answered 7 hours ago
Mark L. StoneMark L. Stone
2,8876 silver badges26 bronze badges
$endgroup$
add a comment |
$begingroup$
P vs. NP may come "under" the category of Operational Research (O.R.). But unlike theoretical computer science and algorithm analysis, in which P vs. NP may be a be all and end all, practical (non-academic) O.R. people are not necessarily fixated on it.
In some circles, NP Hard is essentially considered to mean unsolvable. However, there are several commercial MILP (Mixed Integer Linear Programming) vendors whose entire business model is predicated on the ability and success of their customers to routinely solve NP Hard problems of practical business significance - that is O.R. in action.
answered 7 hours ago
Mark L. StoneMark L. Stone
2,8876 silver badges26 bronze badges
$endgroup$
P vs. NP may come "under" the category of Operational Research (O.R.). But unlike theoretical computer science and algorithm analysis, in which P vs. NP may be a be all and end all, practical (non-academic) O.R. people are not necessarily fixated on it.
In some circles, NP Hard is essentially considered to mean unsolvable. However, there are several commercial MILP (Mixed Integer Linear Programming) vendors whose entire business model is predicated on the ability and success of their customers to routinely solve NP Hard problems of practical business significance - that is O.R. in action.
answered 7 hours ago
Mark L. StoneMark L. Stone
2,8876 silver badges26 bronze badges
answered 7 hours ago
Mark L. StoneMark L. Stone
2,8876 silver badges26 bronze badges
answered 7 hours ago
Mark L. StoneMark L. Stone
2,8876 silver badges26 bronze badges
answered 7 hours ago
Mark L. StoneMark L. Stone
2,8876 silver badges26 bronze badges
2,8876 silver badges26 bronze badges
add a comment |
add a comment |
$begingroup$
As mentioned by others, OR is definitely involved in the P vs. NP issue. If you can find a polynomial time algorithm to solve the Quadratic Assignment Problem or the TSP which Marco mentioned, both of which are essentially OR problems, then you can say P = NP.
But, the P vs. NP issue is not strictly “under” OR because there are other fields which are closely intertwined with the “debate” (pure math, applied math, computer science).
answered 7 hours ago
dxbdxb
5531 silver badge13 bronze badges
$endgroup$
add a comment |
$begingroup$
As mentioned by others, OR is definitely involved in the P vs. NP issue. If you can find a polynomial time algorithm to solve the Quadratic Assignment Problem or the TSP which Marco mentioned, both of which are essentially OR problems, then you can say P = NP.
But, the P vs. NP issue is not strictly “under” OR because there are other fields which are closely intertwined with the “debate” (pure math, applied math, computer science).
answered 7 hours ago
dxbdxb
5531 silver badge13 bronze badges
$endgroup$
add a comment |
$begingroup$
As mentioned by others, OR is definitely involved in the P vs. NP issue. If you can find a polynomial time algorithm to solve the Quadratic Assignment Problem or the TSP which Marco mentioned, both of which are essentially OR problems, then you can say P = NP.
But, the P vs. NP issue is not strictly “under” OR because there are other fields which are closely intertwined with the “debate” (pure math, applied math, computer science).
answered 7 hours ago
dxbdxb
5531 silver badge13 bronze badges
$endgroup$
As mentioned by others, OR is definitely involved in the P vs. NP issue. If you can find a polynomial time algorithm to solve the Quadratic Assignment Problem or the TSP which Marco mentioned, both of which are essentially OR problems, then you can say P = NP.
But, the P vs. NP issue is not strictly “under” OR because there are other fields which are closely intertwined with the “debate” (pure math, applied math, computer science).
answered 7 hours ago
dxbdxb
5531 silver badge13 bronze badges
answered 7 hours ago
dxbdxb
5531 silver badge13 bronze badges
answered 7 hours ago
dxbdxb
5531 silver badge13 bronze badges
answered 7 hours ago
dxbdxb
5531 silver badge13 bronze badges
5531 silver badge13 bronze badges
add a comment |
add a comment |
Vikranth Inti is a new contributor. Be nice, and check out our Code of Conduct.
Vikranth Inti is a new contributor. Be nice, and check out our Code of Conduct.
Vikranth Inti is a new contributor. Be nice, and check out our Code of Conduct.
Vikranth Inti is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Operations Research Stack Exchange!
- 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%2for.stackexchange.com%2fquestions%2f1132%2fdoes-the-problem-of-p-vs-np-come-under-the-category-of-operational-research%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
$begingroup$
X-posted: math.stackexchange.com/q/3310472/339790
$endgroup$
– Rodrigo de Azevedo
50 mins ago