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?

Constantine N. Goulimis ()
Additional contact information
Constantine N. Goulimis: Greycon Ltd., Plantation Wharf, London SW11 3TN, United Kingdom

Interfaces, 2007, vol. 37, issue 6, 584-586

Abstract: 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.

Keywords: complexity; NP-complete (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/inte.1070.0305 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orinte:v:37:y:2007:i:6:p:584-586

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().