IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/8fc31de5-93ae-4966-836a-f2598a425033.html
   My bibliography  Save this paper

A Note on the Stability Number of an Orthogonality Graph

Author

Listed:
  • de Klerk, E.

    (Tilburg University, School of Economics and Management)

  • Pasechnik, D.V.

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • de Klerk, E. & Pasechnik, D.V., 2005. "A Note on the Stability Number of an Orthogonality Graph," Other publications TiSEM 8fc31de5-93ae-4966-836a-f, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:8fc31de5-93ae-4966-836a-f2598a425033
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Monique Laurent, 2003. "A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0--1 Programming," Mathematics of Operations Research, INFORMS, vol. 28(3), pages 470-496, August.
    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. Laurent, Monique & Vargas, Luis Felipe, 2022. "Finite convergence of sum-of-squares hierarchies for the stability number of a graph," Other publications TiSEM 3998b864-7504-4cf4-bc1d-f, Tilburg University, School of Economics and Management.
    2. Adam Kurpisz & Samuli Leppänen & Monaldo Mastrolilli, 2018. "Sum-of-squares rank upper bounds for matching problems," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 831-844, October.
    3. Pratik Worah, 2015. "Rank bounds for a hierarchy of Lovász and Schrijver," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 689-709, October.
    4. Thomas Rothvoß & Laura Sanità, 2017. "0/1 Polytopes with Quadratic Chvátal Rank," Operations Research, INFORMS, vol. 65(1), pages 212-220, February.
    5. Adam Kurpisz & Samuli Leppänen & Monaldo Mastrolilli, 2017. "On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 135-143, January.
    6. Gábor Braun & Samuel Fiorini & Sebastian Pokutta & David Steurer, 2015. "Approximation Limits of Linear Programs (Beyond Hierarchies)," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 756-772, March.
    7. Thomas Rothvoß & Laura Sanità, 2017. "0/1 Polytopes with Quadratic Chvátal Rank," Operations Research, INFORMS, vol. 65(1), pages 212-220, February.
    8. Tong Chen & Jean-Bernard Lasserre & Victor Magron & Edouard Pauwels, 2022. "A sublevel moment-SOS hierarchy for polynomial optimization," Computational Optimization and Applications, Springer, vol. 81(1), pages 31-66, January.
    9. de Klerk, E. & Pasechnik, D.V., 2009. "On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems," Other publications TiSEM 3b5033a4-98bc-4969-aa57-d, Tilburg University, School of Economics and Management.
    10. Trang T. Nguyen & Jean-Philippe P. Richard & Mohit Tawarmalani, 2021. "Convexification techniques for linear complementarity constraints," Journal of Global Optimization, Springer, vol. 80(2), pages 249-286, June.
    11. Jean B. Lasserre & Kim-Chuan Toh & Shouguang Yang, 2017. "A bounded degree SOS hierarchy for polynomial optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 87-117, March.

    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:8fc31de5-93ae-4966-836a-f2598a425033. 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: 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.