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

Computational study of valid inequalities for the maximum k-cut problem

Author

Listed:
  • Vilmar Jefté Rodrigues de Sousa

    (Polytechnique Montréal)

  • Miguel F. Anjos

    (Polytechnique Montréal)

  • Sébastien Le Digabel

    (Polytechnique Montréal)

Abstract

We consider the maximum k-cut problem that consists in partitioning the vertex set of a graph into k subsets such that the sum of the weights of edges joining vertices in different subsets is maximized. We focus on identifying effective classes of inequalities to tighten the semidefinite programming relaxation. We carry out an experimental study of four classes of inequalities from the literature: clique, general clique, wheel and bicycle wheel. We considered 10 combinations of these classes and tested them on both dense and sparse instances for $$ k \in \{3,4,5,7\} $$ k ∈ { 3 , 4 , 5 , 7 } . Our computational results suggest that the bicycle wheel and wheel are the strongest inequalities for $$ k=3 $$ k = 3 , and that for $$ k \in \{4,5,7\} $$ k ∈ { 4 , 5 , 7 } the wheel inequalities are the strongest by far. Furthermore, we observe an improvement in the performance for all choices of k when both bicycle wheel and wheel are used, at the cost of 72% more CPU time on average when compared with using only one of them.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:265:y:2018:i:1:d:10.1007_s10479-017-2448-9
    DOI: 10.1007/s10479-017-2448-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2448-9
    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-2448-9?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. Fuda Ma & Jin-Kao Hao, 2017. "A multiple search operator heuristic for the max-k-cut problem," Annals of Operations Research, Springer, vol. 248(1), pages 365-403, January.
    2. M. Deza & M. Grötschel & M. Laurent, 1992. "Clique-Web Facets for Multicut Polytopes," Mathematics of Operations Research, INFORMS, vol. 17(4), pages 981-1000, November.
    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. A. M. H. Gerards, 1985. "Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope," Mathematics of Operations Research, INFORMS, vol. 10(2), pages 359-360, May.
    5. de Klerk, E. & Pasechnik, D.V. & Warners, J.P., 2004. "On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function," Other publications TiSEM 7a6fbcee-93d0-4f7d-86be-b, Tilburg University, School of Economics and Management.
    6. 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.
    7. Bissan Ghaddar & Miguel Anjos & Frauke Liers, 2011. "A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem," Annals of Operations Research, Springer, vol. 188(1), pages 155-174, August.
    8. Francisco Barahona & Martin Grötschel & Michael Jünger & Gerhard Reinelt, 1988. "An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design," Operations Research, INFORMS, vol. 36(3), pages 493-513, June.
    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. 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.
    2. Vilmar Jefté Rodrigues de Sousa & Miguel F. Anjos & Sébastien Le Digabel, 2019. "Improving the linear relaxation of maximum k-cut with semidefinite-based constraints," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(2), pages 123-151, June.

    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. Vilmar Jefté Rodrigues de Sousa & Miguel F. Anjos & Sébastien Le Digabel, 2019. "Improving the linear relaxation of maximum k-cut with semidefinite-based constraints," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(2), pages 123-151, June.
    2. 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.
    3. 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.
    4. Bissan Ghaddar & Miguel Anjos & Frauke Liers, 2011. "A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem," Annals of Operations Research, Springer, vol. 188(1), pages 155-174, August.
    5. Fuda Ma & Jin-Kao Hao, 2017. "A multiple search operator heuristic for the max-k-cut problem," Annals of Operations Research, Springer, vol. 248(1), pages 365-403, January.
    6. Wenxing Zhu & Geng Lin & M. M. Ali, 2013. "Max- k -Cut by the Discrete Dynamic Convexized Method," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 27-40, February.
    7. F. Rendl, 2016. "Semidefinite relaxations for partitioning, assignment and ordering problems," Annals of Operations Research, Springer, vol. 240(1), pages 119-140, May.
    8. 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.
    9. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
    10. Adam N. Letchford, 2001. "On Disjunctive Cuts for Combinatorial Optimization," Journal of Combinatorial Optimization, Springer, vol. 5(3), pages 299-315, September.
    11. Dell'Amico, Mauro & Trubian, Marco, 1998. "Solution of large weighted equicut problems," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 500-521, April.
    12. Shenshen Gu & Yue Yang, 2020. "A Deep Learning Algorithm for the Max-Cut Problem Based on Pointer Network Structure with Supervised Learning and Reinforcement Learning Strategies," Mathematics, MDPI, vol. 8(2), pages 1-20, February.
    13. Renata Sotirov, 2018. "Graph bisection revisited," Annals of Operations Research, Springer, vol. 265(1), pages 143-154, June.
    14. repec:dgr:rugsom:99a17 is not listed on IDEAS
    15. Weber, Shlomo & Castaneda Dower, Paul & Gokmen, Gunes & Le Breton, Michel, 2021. "Did the Cold War Produce Development Clusters in Africa?," CEPR Discussion Papers 15810, C.E.P.R. Discussion Papers.
    16. Giovanni Giallombardo & Houyuan Jiang & Giovanna Miglionico, 2016. "New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials," Operations Research, INFORMS, vol. 64(4), pages 838-848, August.
    17. Gili Rosenberg & Mohammad Vazifeh & Brad Woods & Eldad Haber, 2016. "Building an iterative heuristic solver for a quantum annealer," Computational Optimization and Applications, Springer, vol. 65(3), pages 845-869, December.
    18. Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    19. Pierre Fouilhoux & A. Mahjoub, 2012. "Solving VLSI design and DNA sequencing problems using bipartization of graphs," Computational Optimization and Applications, Springer, vol. 51(2), pages 749-781, March.
    20. Goldengorin, Boris & Ghosh, Diptesh, 2004. "A Multilevel Search Algorithm for the Maximization of Submodular Functions," Research Report 04A20, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    21. Hongwei Liu & Sanyang Liu & Fengmin Xu, 2003. "A Tight Semidefinite Relaxation of the MAX CUT Problem," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 237-245, September.

    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-2448-9. 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.