IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/b1f1088c-95fe-4b8a-9e15-c7960d97d68e.html
   My bibliography  Save this paper

Integrality and cutting planes in semidefinite programming approaches for combinatorial optimization

Author

Listed:
  • de Meijer, Frank

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • de Meijer, Frank, 2023. "Integrality and cutting planes in semidefinite programming approaches for combinatorial optimization," Other publications TiSEM b1f1088c-95fe-4b8a-9e15-c, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:b1f1088c-95fe-4b8a-9e15-c7960d97d68e
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Yichuan Ding & Dongdong Ge & Henry Wolkowicz, 2011. "On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 88-104, February.
    2. Juliane Dunkel & Andreas S. Schulz, 2012. "The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope," Operations Research Proceedings, in: Diethard Klatte & Hans-Jakob Lüthi & Karl Schmedders (ed.), Operations Research Proceedings 2011, edition 127, pages 587-592, Springer.
    3. Eranda Çela & Vladimir G. Deineko & Gerhard J. Woeginger, 2016. "Linearizable special cases of the QAP," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1269-1279, April.
    4. G. Dantzig & R. Fulkerson & S. Johnson, 1954. "Solution of a Large-Scale Traveling-Salesman Problem," Operations Research, INFORMS, vol. 2(4), pages 393-410, November.
    5. Warren P. Adams & Hanif D. Sherali, 1986. "A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems," Management Science, INFORMS, vol. 32(10), pages 1274-1290, October.
    6. Daniel Dadush & Santanu S. Dey & Juan Pablo Vielma, 2011. "The Chvátal-Gomory Closure of a Strictly Convex Body," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 227-239, May.
    7. Paolo Carraresi & Federico Malucelli, 1992. "A New Lower Bound for the Quadratic Assignment Problem," Operations Research, INFORMS, vol. 40(1-supplem), pages 22-27, February.
    8. Ante Ćustić & Abraham P. Punnen, 2018. "A characterization of linearizable instances of the quadratic minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 436-453, February.
    9. Bomze, Immanuel M. & Gabl, Markus, 2023. "Optimization under uncertainty and risk: Quadratic and copositive approaches," European Journal of Operational Research, Elsevier, vol. 310(2), pages 449-476.
    10. FERREIRA, Carlos E. & MARTIN, Alexander & de SOUZA, Cid C. & WEISMANTEL, Robert, 1998. "The node capacitated graph partitioning problem: A computational study," LIDAM Reprints CORE 1335, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. Warren P. Adams & Hanif D. Sherali, 1990. "Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems," Operations Research, INFORMS, vol. 38(2), pages 217-226, April.
    12. Arjang Assad & Weixuan Xu, 1992. "The quadratic minimum spanning tree problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 399-417, April.
    13. Adelaide Cerveira & Agostinho Agra & Fernando Bastos & Joaquim Gromicho, 2013. "A new Branch and Bound method for a discrete truss topology design problem," Computational Optimization and Applications, Springer, vol. 54(1), pages 163-187, January.
    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. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.
    2. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    3. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    4. Sven Mallach, 2021. "Inductive linearization for binary quadratic programs with linear constraints," 4OR, Springer, vol. 19(4), pages 549-570, December.
    5. Guanglei Wang & Hassan Hijazi, 2018. "Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches," Computational Optimization and Applications, Springer, vol. 71(2), pages 553-608, November.
    6. Hanif Sherali, 2007. "RLT: A unified approach for discrete and continuous nonconvex optimization," Annals of Operations Research, Springer, vol. 149(1), pages 185-193, February.
    7. Pessoa, Artur Alves & Hahn, Peter M. & Guignard, Monique & Zhu, Yi-Rong, 2010. "Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique," European Journal of Operational Research, Elsevier, vol. 206(1), pages 54-63, October.
    8. Ante Ćustić & Abraham P. Punnen, 2018. "A characterization of linearizable instances of the quadratic minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 436-453, February.
    9. de Klerk, Etienne & -Nagy, Marianna E. & Sotirov, Renata & Truetsch, Uwe, 2014. "Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 488-499.
    10. Peter Hahn & J. MacGregor Smith & Yi-Rong Zhu, 2010. "The Multi-Story Space Assignment Problem," Annals of Operations Research, Springer, vol. 179(1), pages 77-103, September.
    11. Warren Adams & Hanif Sherali, 2005. "A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems," Annals of Operations Research, Springer, vol. 140(1), pages 21-47, November.
    12. Frank Meijer & Renata Sotirov, 2020. "The quadratic cycle cover problem: special cases and efficient bounds," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 1096-1128, May.
    13. Zvi Drezner & Peter Hahn & Éeric Taillard, 2005. "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods," Annals of Operations Research, Springer, vol. 139(1), pages 65-94, October.
    14. Antonio Frangioni & Fabio Furini & Claudio Gentile, 2016. "Approximated perspective relaxations: a project and lift approach," Computational Optimization and Applications, Springer, vol. 63(3), pages 705-735, April.
    15. Teles, João P. & Castro, Pedro M. & Matos, Henrique A., 2013. "Univariate parameterization for global optimization of mixed-integer polynomial problems," European Journal of Operational Research, Elsevier, vol. 229(3), pages 613-625.
    16. Pereira, Dilson Lucas & Salles da Cunha, Alexandre, 2020. "Dynamic intersection of multiple implicit Dantzig–Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 284(2), pages 413-426.
    17. Lucas A. Waddell & Jerry L. Phillips & Tianzhu Liu & Swarup Dhar, 2023. "An LP-based characterization of solvable QAP instances with chess-board and graded structures," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-23, July.
    18. Peter M. Hahn & Yi-Rong Zhu & Monique Guignard & William L. Hightower & Matthew J. Saltzman, 2012. "A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 202-209, May.
    19. Renata Sotirov, 2014. "An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 16-30, February.
    20. Diego Recalde & Ramiro Torres & Polo Vaca, 2020. "An exact approach for the multi-constraint graph partitioning problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 289-308, October.

    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:b1f1088c-95fe-4b8a-9e15-c7960d97d68e. 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.