|Subject:||Re: [Help-glpk] MIP problems|
|Date:||Mon, 7 Mar 2016 09:46:15 -0600|
MIP problems are both. Depends on the problem… Network flow problems are MIP problems that are solved in polynomial time, and Knapsack problems are MIP problems which are NP-hard.
From: help-glpk-bounces+address@hidden [mailto:help-glpk-bounces+address@hidden
On Behalf Of ??SS??????S ?O????S
Hi to everyone,
I have been aware that MIP problems are NP-Complete or even NP-Hard.
Does any one know a reference (perhaps a published paper) in which it is proven that MIP problems are NP- Complete or NP- Hard?
Thank you very much for your time and for any answer.
This e-mail and any attachments may be confidential or legally privileged. If you received this message in error or are not the intended recipient, you should destroy the e-mail message and any attachments or copies, and you are prohibited from retaining, distributing, disclosing or using any information contained herein. Please inform us of the erroneous delivery by return e-mail. Thank you for your cooperation.
|[Prev in Thread]||Current Thread||[Next in Thread]|