IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/3e340431-37b3-4bc5-9b14-9502fe3c374c.html
   My bibliography  Save this paper

The maximum edge biclique problem is NP-complete

Author

Listed:
  • Peeters, M.J.P.

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • Peeters, M.J.P., 2003. "The maximum edge biclique problem is NP-complete," Other publications TiSEM 3e340431-37b3-4bc5-9b14-9, Tilburg University, School of Economics and Management.
  • Handle: RePEc:tiu:tiutis:3e340431-37b3-4bc5-9b14-9502fe3c374c
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/549166/dambicl.pdf
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sumit Kunnumkal & Kalyan Talluri, 2019. "Choice Network Revenue Management Based on New Tractable Approximations," Transportation Science, INFORMS, vol. 53(6), pages 1591-1608, November.
    2. Aaditya V Rangan & Caroline C McGrouther & John Kelsoe & Nicholas Schork & Eli Stahl & Qian Zhu & Arjun Krishnan & Vicky Yao & Olga Troyanskaya & Seda Bilaloglu & Preeti Raghavan & Sarah Bergen & Ande, 2018. "A loop-counting method for covariate-corrected low-rank biclustering of gene-expression and genome-wide association study data," PLOS Computational Biology, Public Library of Science, vol. 14(5), pages 1-29, May.
    3. GILLIS, Nicolas & GLINEUR, François, 2010. "Low-rank matrix approximation with weights or missing data is NP-hard," LIDAM Discussion Papers CORE 2010075, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Nicolas Gillis & François Glineur, 2014. "A continuous characterization of the maximum-edge biclique problem," Journal of Global Optimization, Springer, vol. 58(3), pages 439-464, March.
    5. Sumit Kunnumkal & Kalyan Talluri, 2012. "A New Compact Linear Programming Formulation for Choice Network Revenue Management," Working Papers 677, Barcelona School of Economics.
    6. Brendan P. W. Ames, 2015. "Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex Relaxation," Journal of Optimization Theory and Applications, Springer, vol. 167(2), pages 653-675, November.
    7. Sumit Kunnumkal & Kalyan Talluri, 2012. "A new compact linear programming formulation for choice network revenue management," Economics Working Papers 1349, Department of Economics and Business, Universitat Pompeu Fabra.
    8. Derval, Guillaume & Schaus, Pierre, 2022. "Maximal-Sum submatrix search using a hybrid contraint programming/linear programming approach," European Journal of Operational Research, Elsevier, vol. 297(3), pages 853-865.
    9. Alejandra Casado & Sergio Pérez-Peló & Jesús Sánchez-Oro & Abraham Duarte, 2022. "A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem," Journal of Heuristics, Springer, vol. 28(1), pages 121-146, February.
    10. GILLIS, Nicolas & GLINEUR, François, 2008. "Nonnegative factorization and the maximum edge biclique problem," LIDAM Discussion Papers CORE 2008064, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. GILLIS, Nicolas & GLINEUR, François, 2010. "On the geometric interpretation of the nonnegative rank," LIDAM Discussion Papers CORE 2010051, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    More about this item

    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:tiu:tiutis:3e340431-37b3-4bc5-9b14-9502fe3c374c. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.