A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s10479-008-0481-4
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- 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.
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- 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.
- Angelika Wiegele & Shudian Zhao, 2022. "SDP-based bounds for graph partition via extended ADMM," Computational Optimization and Applications, Springer, vol. 82(1), pages 251-291, May.
- F. Rendl, 2016. "Semidefinite relaxations for partitioning, assignment and ordering problems," Annals of Operations Research, Springer, vol. 240(1), pages 119-140, May.
- Joe Naoum-Sawaya & Christoph Buchheim, 2016. "Robust Critical Node Selection by Benders Decomposition," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 162-174, February.
- 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.
- 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.
- 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.
- 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.
- 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.
- Veronica Piccialli & Antonio M. Sudoso & Angelika Wiegele, 2022. "SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2144-2162, July.
- 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.
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.- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- repec:dgr:rugsom:99a17 is not listed on IDEAS
- 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.
- 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.
- 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).
- 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.
- Daya Ram Gaur & Ramesh Krishnamurti & Rajeev Kohli, 2009. "Conflict Resolution in the Scheduling of Television Commercials," Operations Research, INFORMS, vol. 57(5), pages 1098-1105, October.
- Goldengorin, Boris & Tijssen, Gert A. & Tso, Michael, 1999. "The maximization of submodular functions : old and new proofs for the correctness of the dichotomy algorithm," Research Report 99A17, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
- repec:dgr:rugsom:98a08 is not listed on IDEAS
- Ling, Ai-Fan & Xu, Cheng-Xian & Xu, Feng-Min, 2009. "A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems," European Journal of Operational Research, Elsevier, vol. 197(2), pages 519-531, September.
- F. Rendl, 2016. "Semidefinite relaxations for partitioning, assignment and ordering problems," Annals of Operations Research, Springer, vol. 240(1), pages 119-140, May.
- Mansouri, Bahareh & Hassini, Elkafi, 2019. "Optimal pricing in iterative flexible combinatorial procurement auctions," European Journal of Operational Research, Elsevier, vol. 277(3), pages 1083-1097.
- Chuangchuang Sun, 2023. "A Customized ADMM Approach for Large-Scale Nonconvex Semidefinite Programming," Mathematics, MDPI, vol. 11(21), pages 1-27, October.
- Kuryatnikova, Olga & Sotirov, Renata & Vera, J.C., 2022. "The maximum $k$-colorable subgraph problem and related problems," Other publications TiSEM 40e477c0-a78e-4ee1-92de-8, Tilburg University, School of Economics and Management.
- F. Liers & G. Pardella, 2012. "Partitioning planar graphs: a fast combinatorial approach for max-cut," Computational Optimization and Applications, Springer, vol. 51(1), pages 323-344, January.
- Chao Yun & Zhongyu Liang & Aleš Hrabec & Zhentao Liu & Mantao Huang & Leran Wang & Yifei Xiao & Yikun Fang & Wei Li & Wenyun Yang & Yanglong Hou & Jinbo Yang & Laura J. Heyderman & Pietro Gambardella , 2023. "Electrically programmable magnetic coupling in an Ising network exploiting solid-state ionic gating," Nature Communications, Nature, vol. 14(1), pages 1-9, December.
More about this item
Keywords
Minimum k-partition; Semidefinite programming; Branch-and-cut; Polyhedral cuts;All these keywords.
Statistics
Access and download statisticsCorrections
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:188:y:2011:i:1:p:155-174:10.1007/s10479-008-0481-4. 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.