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?

  • Authors:

  • Constantine N. Goulimis

  • Affiliations:

  • Greycon Ltd., Plantation Wharf, London SW11 3TN, United Kingdom

  • Venue:
  • Interfaces
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.