IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v37y2007i6p584-586.html
   My bibliography  Save this article

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?

Author

Listed:
  • Constantine N. Goulimis

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

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.

Suggested Citation

  • 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, INFORMS, vol. 37(6), pages 584-586, December.
  • Handle: RePEc:inm:orinte:v:37:y:2007:i:6:p:584-586
    DOI: 10.1287/inte.1070.0305
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1070.0305
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.1070.0305?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Schirmer, Andreas, 1995. "A guide to complexity theory in operations research," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 381, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Craig A. Tovey, 2002. "Tutorial on Computational Complexity," Interfaces, INFORMS, vol. 32(3), pages 30-61, June.
    3. Dawn M. Strickland & Earl Barnes & Joel S. Sokol, 2005. "Optimal Protein Structure Alignment Using Maximum Cliques," Operations Research, INFORMS, vol. 53(3), pages 389-402, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Salewski, Frank & Schirmer, Andreas & Drexl, Andreas, 1996. "Project Scheduling under Resource and Mode Identity Constraints. Part II: An Application to Audit-Staff Scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 388, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    3. Steffen Rebennack & Marcus Oswald & Dirk Oliver Theis & Hanna Seitz & Gerhard Reinelt & Panos M. Pardalos, 2011. "A Branch and Cut solver for the maximum stable set problem," Journal of Combinatorial Optimization, Springer, vol. 21(4), pages 434-457, May.
    4. Mavrommatis, George, 2008. "Learning objects and objectives towards automatic learning construction," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1449-1458, June.
    5. Yongjie Yang & Dinko Dimitrov, 2019. "The complexity of shelflisting," Theory and Decision, Springer, vol. 86(1), pages 123-141, February.
    6. Schirmer, Andreas, 1996. "New insights on the complexity of resource-constrained project scheduling: A case of single-mode scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 390, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Piotr Łukasiak & Jacek Błażewicz & Maciej Miłostan, 2010. "Some operations research methods for analyzing protein sequences and structures," Annals of Operations Research, Springer, vol. 175(1), pages 9-35, March.
    8. Salewski, Frank & Schirmer, Andreas & Drexl, Andreas, 1997. "Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application," European Journal of Operational Research, Elsevier, vol. 102(1), pages 88-110, October.
    9. Salewski, Frank & Schirmer, Andreas & Drexl, Andreas, 1996. "Project Scheduling under Resource and Mode Identity Constraints. Part I: Model, Complexity Status, and Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 387, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Schirmer, Andreas & Potzahr, Kathrin, 2001. "Lehrgangsplanung für die Ausbildung von Verkehrsflugzeugführern: Ergebnisse einer Studie bei Lufthansa Flight Training," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 538, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Alexandra M. Newman & Martin Weiss, 2013. "A Survey of Linear and Mixed-Integer Optimization Tutorials," INFORMS Transactions on Education, INFORMS, vol. 14(1), pages 26-38, September.
    12. Schirmer, Andreas & Drexl, Andreas, 1997. "Allocation of partially renewable resources: Concept, models and applications," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 455, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Peter Brown & Yuedong Yang & Yaoqi Zhou & Wayne Pullan, 2017. "A heuristic for the time constrained asymmetric linear sum assignment problem," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 551-566, February.
    14. Milad Zamanifar & Timo Hartmann, 2020. "Optimization-based decision-making models for disaster recovery and reconstruction planning of transportation networks," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 104(1), pages 1-25, October.
    15. Fan Zhou & Kunpeng Zhang & Shuying Xie & Xucheng Luo, 2020. "Learning to Correlate Accounts Across Online Social Networks: An Embedding-Based Approach," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 714-729, July.
    16. Pattillo, Jeffrey & Youssef, Nataly & Butenko, Sergiy, 2013. "On clique relaxation models in network analysis," European Journal of Operational Research, Elsevier, vol. 226(1), pages 9-18.
    17. Schirmer, Andreas, 1996. "New insights on the complexity of resource-constrained project scheduling: Two cases of multi-mode scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 391, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Chu-Min Li & Zhiwen Fang & Hua Jiang & Ke Xu, 2018. "Incremental Upper Bound for the Maximum Clique Problem," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 137-153, February.
    19. Yang, Yongjie & Dimitrov, Dinko, 2023. "Group control for consent rules with consecutive qualifications," Mathematical Social Sciences, Elsevier, vol. 121(C), pages 1-7.
    20. Douglas Altner & Özlem Ergun, 2011. "Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems," Annals of Operations Research, Springer, vol. 184(1), pages 3-26, April.

    More about this item

    Keywords

    complexity; NP-complete;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:37:y:2007:i:6:p:584-586. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.