IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v265y2018i1d10.1007_s10479-017-2575-3.html
   My bibliography  Save this article

Graph bisection revisited

Author

Listed:
  • Renata Sotirov

    (Tilburg University)

Abstract

The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation for the graph bisection problem with a matrix variable of order n—the number of vertices of the graph—that is equivalent to the currently strongest semidefinite programming relaxation obtained by using vector lifting. The reduction in the size of the matrix variable enables us to impose additional valid inequalities to the relaxation in order to further strengthen it. The numerical results confirm that our simplified and strengthened semidefinite relaxation provides the currently strongest bound for the graph bisection problem in reasonable time.

Suggested Citation

  • Renata Sotirov, 2018. "Graph bisection revisited," Annals of Operations Research, Springer, vol. 265(1), pages 143-154, June.
    • Handle: RePEc:spr:annopr:v:265:y:2018:i:1:d:10.1007_s10479-017-2575-3
    DOI: 10.1007/s10479-017-2575-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2575-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-017-2575-3?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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).
    2. DE SOUZA, Cid C. & KEUNINGS, Roland & WOLSEY, Laurence A. & ZONE, Olivier, 1994. "A new approach to minimising the frontwidth in finite element calculations," LIDAM Reprints CORE 1076, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. 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.
    4. Stefan E. Karisch & Franz Rendl & Jens Clausen, 2000. "Solving Graph Bisection Problems with Semidefinite Programming," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 177-191, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Hu, Hao & Sotirov, Renata & Wolkowicz, Henry, 2023. "Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs," Other publications TiSEM 8dd3dbae-58fd-4238-b786-e, Tilburg University, School of Economics and Management.

    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. 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.
    2. 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.
    3. Stefan E. Karisch & Franz Rendl & Jens Clausen, 2000. "Solving Graph Bisection Problems with Semidefinite Programming," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 177-191, August.
    4. Anuj Mehrotra & Joseph Shantz & Michael A. Trick, 2005. "Determining newspaper marketing zones using contiguous clustering," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 82-92, February.
    5. Cheng Lu & Zhibin Deng, 2021. "A branch-and-bound algorithm for solving max-k-cut problem," Journal of Global Optimization, Springer, vol. 81(2), pages 367-389, October.
    6. Jamie Fairbrother & Adam N. Letchford & Keith Briggs, 2018. "A two-level graph partitioning problem arising in mobile wireless communications," Computational Optimization and Applications, Springer, vol. 69(3), pages 653-676, April.
    7. 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.
    8. A I Jarrah & J F Bard, 2011. "Pickup and delivery network segmentation using contiguous geographic clustering," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(10), pages 1827-1843, October.
    9. Gintaras Palubeckis & Dalius Rubliauskas, 2012. "A branch-and-bound algorithm for the minimum cut linear arrangement problem," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 540-563, November.
    10. E. R. van Dam & R. Sotirov, 2015. "On Bounding the Bandwidth of Graphs with Symmetry," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 75-88, February.
    11. Vilmar Jefté Rodrigues de Sousa & Miguel F. Anjos & Sébastien Le Digabel, 2018. "Computational study of valid inequalities for the maximum k-cut problem," Annals of Operations Research, Springer, vol. 265(1), pages 5-27, June.
    12. John E. Mitchell, 2003. "Realignment in the National Football League: Did they do it right?," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 683-701, October.
    13. Zhang, Ruolin & Masoud, Neda, 2021. "A distributed algorithm for operating large-scale ridesourcing systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    14. Olga Kuryatnikova & Renata Sotirov & Juan C. Vera, 2022. "The Maximum k -Colorable Subgraph Problem and Related Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 656-669, January.
    15. Diego Recalde & Daniel Severín & Ramiro Torres & Polo Vaca, 2018. "An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 916-936, October.
    16. Albareda-Sambola, Maria & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2019. "Reformulated acyclic partitioning for rail-rail containers transshipment," European Journal of Operational Research, Elsevier, vol. 277(1), pages 153-165.
    17. Michael M. Sørensen, 2004. "b-Tree Facets for the Simple Graph Partitioning Polytope," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 151-170, June.

    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:spr:annopr:v:265:y:2018:i:1:d:10.1007_s10479-017-2575-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.