NP-completeness is often used as an argument for the development of heuristic algorithms, as opposed to optimal ones. The intent of this article is to show that this is a mistake.
Constantine N. Goulimis, (2007) ASP, The Art and Science of Practice: Appeal to NP-Completeness Considered Harmful: Does the Fact That a Problem Is NP-Complete Tell Us Anything?. Interfaces 37(6):584-586.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.