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?

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?

0.00 Avg rating—0 Votes
Article ID: iaor200947198
Country: United States
Volume: 37
Issue: 6
Start Page Number: 584
End Page Number: 586
Publication Date: Nov 2007
Journal: Interfaces
Authors:
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.