Healy, Patrick; Jozefowiez, Nicolas; Laroche, Pierre; Marchetti, Franc; Martin, Sébastien; Róka, Zsuzsanna A branch-and-cut algorithm for the connected max-\(k\)-cut problem. (English) Zbl 07764612 Eur. J. Oper. Res. 312, No. 1, 117-124 (2024). MSC: 90Bxx PDFBibTeX XMLCite \textit{P. Healy} et al., Eur. J. Oper. Res. 312, No. 1, 117--124 (2024; Zbl 07764612) Full Text: DOI
Wu, Shufei; Li, Amin Max-cut by excluding bipartite subgraphs. (English) Zbl 1525.05090 Bull. Aust. Math. Soc. 108, No. 2, 177-186 (2023). MSC: 05C30 05C70 05C35 05C75 PDFBibTeX XMLCite \textit{S. Wu} and \textit{A. Li}, Bull. Aust. Math. Soc. 108, No. 2, 177--186 (2023; Zbl 1525.05090) Full Text: DOI
Jarre, Florian A simple introduction to higher order liftings for binary problems. (English) Zbl 07753345 Pac. J. Optim. 19, No. 3, 411-421 (2023). MSC: 52Bxx 05C50 05C70 52B11 PDFBibTeX XMLCite \textit{F. Jarre}, Pac. J. Optim. 19, No. 3, 411--421 (2023; Zbl 07753345) Full Text: Link
Fox, Jacob; Himwich, Zoe; Mani, Nitya Making an \(H\)-free graph \(k\)-colorable. (English) Zbl 1522.05226 J. Graph Theory 102, No. 2, 234-261 (2023). MSC: 05C35 05C75 05C30 05C15 PDFBibTeX XMLCite \textit{J. Fox} et al., J. Graph Theory 102, No. 2, 234--261 (2023; Zbl 1522.05226) Full Text: DOI arXiv
Campos, Juan S.; Misener, Ruth; Parpas, Panos Partial Lasserre relaxation for sparse Max-Cut. (English) Zbl 07739476 Optim. Eng. 24, No. 3, 1983-2004 (2023). MSC: 68-XX 90-XX PDFBibTeX XMLCite \textit{J. S. Campos} et al., Optim. Eng. 24, No. 3, 1983--2004 (2023; Zbl 07739476) Full Text: DOI
Wu, Shufei; Hou, Jianfeng Graph partitioning: an updated survey. (English) Zbl 1519.05209 AKCE Int. J. Graphs Comb. 20, No. 1, 9-19 (2023). MSC: 05C70 05C20 05C35 PDFBibTeX XMLCite \textit{S. Wu} and \textit{J. Hou}, AKCE Int. J. Graphs Comb. 20, No. 1, 9--19 (2023; Zbl 1519.05209) Full Text: DOI
Steinerberger, Stefan Max-Cut via Kuramoto-type oscillators. (English) Zbl 07709667 SIAM J. Appl. Dyn. Syst. 22, No. 2, 730-743 (2023). MSC: 68R10 05C69 82B20 90C06 PDFBibTeX XMLCite \textit{S. Steinerberger}, SIAM J. Appl. Dyn. Syst. 22, No. 2, 730--743 (2023; Zbl 07709667) Full Text: DOI arXiv
Lu, Cheng; Deng, Zhibin; Fang, Shu-Cherng; Xing, Wenxun A new global algorithm for max-cut problem with chordal sparsity. (English) Zbl 1519.90207 J. Optim. Theory Appl. 197, No. 2, 608-638 (2023). MSC: 90C27 90C20 90C57 PDFBibTeX XMLCite \textit{C. Lu} et al., J. Optim. Theory Appl. 197, No. 2, 608--638 (2023; Zbl 1519.90207) Full Text: DOI
Gutin, Gregory; Yeo, Anders Lower bounds for maximum weighted cut. (English) Zbl 1517.05140 SIAM J. Discrete Math. 37, No. 2, 1142-1161 (2023). MSC: 05C70 05C22 05C35 PDFBibTeX XMLCite \textit{G. Gutin} and \textit{A. Yeo}, SIAM J. Discrete Math. 37, No. 2, 1142--1161 (2023; Zbl 1517.05140) Full Text: DOI arXiv
Hrga, Timotej; Povh, Janez Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B. (English) Zbl 1519.90152 Optim. Lett. 17, No. 5, 1201-1213 (2023). MSC: 90C22 90C59 PDFBibTeX XMLCite \textit{T. Hrga} and \textit{J. Povh}, Optim. Lett. 17, No. 5, 1201--1213 (2023; Zbl 1519.90152) Full Text: DOI
Bourel, Mathias; Canale, Eduardo; Robledo, Franco; Romero, Pablo; Stábile, Luis Complexity and heuristics for the weighted max cut-clique problem. (English) Zbl 07770684 Int. Trans. Oper. Res. 29, No. 2, 908-928 (2022). MSC: 90-XX PDFBibTeX XMLCite \textit{M. Bourel} et al., Int. Trans. Oper. Res. 29, No. 2, 908--928 (2022; Zbl 07770684) Full Text: DOI
Ageron, Romain Trigonometric approximation of the max-cut polytope is star-like. (English) Zbl 1489.90145 Optim. Lett. 16, No. 6, 1963-1967 (2022). MSC: 90C27 90C20 90C57 PDFBibTeX XMLCite \textit{R. Ageron}, Optim. Lett. 16, No. 6, 1963--1967 (2022; Zbl 1489.90145) Full Text: DOI arXiv
Coja-Oghlan, Amin; Loick, Philipp; Mezei, Balázs F.; Sorkin, Gregory B. The Ising antiferromagnet and max cut on random regular graphs. (English) Zbl 07537559 SIAM J. Discrete Math. 36, No. 2, 1306-1342 (2022). MSC: 82-XX 05C80 PDFBibTeX XMLCite \textit{A. Coja-Oghlan} et al., SIAM J. Discrete Math. 36, No. 2, 1306--1342 (2022; Zbl 07537559) Full Text: DOI arXiv
Cioabă, Sebastian M.; Gupta, Himanshu On the eigenvalues of Grassmann graphs, bilinear forms graphs and Hermitian forms graphs. (English) Zbl 1484.05124 Graphs Comb. 38, No. 2, Paper No. 30, 26 p. (2022). MSC: 05C50 05E30 94B05 05B30 90C22 PDFBibTeX XMLCite \textit{S. M. Cioabă} and \textit{H. Gupta}, Graphs Comb. 38, No. 2, Paper No. 30, 26 p. (2022; Zbl 1484.05124) Full Text: DOI arXiv
Kaparis, Konstantinos; Letchford, Adam N.; Mourtos, Ioannis Generalised 2-circulant inequalities for the max-cut problem. (English) Zbl 1525.90361 Oper. Res. Lett. 50, No. 2, 122-128 (2022). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{K. Kaparis} et al., Oper. Res. Lett. 50, No. 2, 122--128 (2022; Zbl 1525.90361) Full Text: DOI
Fernández-Pendás, Mario; Combarro, Elías F.; Vallecorsa, Sofia; Ranilla, José; Rúa, Ignacio F. A study of the performance of classical minimizers in the quantum approximate optimization algorithm. (English) Zbl 1482.90183 J. Comput. Appl. Math. 404, Article ID 113388, 17 p. (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Fernández-Pendás} et al., J. Comput. Appl. Math. 404, Article ID 113388, 17 p. (2022; Zbl 1482.90183) Full Text: DOI
Wang, Tianshi; Wu, Leon; Nobel, Parth; Roychowdhury, Jaijeet Solving combinatorial optimisation problems using oscillator based Ising machines. (English) Zbl 07735490 Nat. Comput. 20, No. 2, 287-306 (2021). MSC: 68Q09 05C15 82B20 90C27 PDFBibTeX XMLCite \textit{T. Wang} et al., Nat. Comput. 20, No. 2, 287--306 (2021; Zbl 07735490) Full Text: DOI
Komusiewicz, Christian; Morawietz, Nils Can local optimality be used for efficient data reduction? (English) Zbl 07667142 Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 12th international conference, CIAC 2021, virtual event, May 10–12, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12701, 354-366 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{C. Komusiewicz} and \textit{N. Morawietz}, Lect. Notes Comput. Sci. 12701, 354--366 (2021; Zbl 07667142) Full Text: DOI
Bibak, Ali; Carlson, Charles; Chandrasekaran, Karthekeyan Improving the smoothed complexity of FLIP for max cut problems. (English) Zbl 07475098 ACM Trans. Algorithms 17, No. 3, Article No. 19, 38 p. (2021). MSC: 68-XX PDFBibTeX XMLCite \textit{A. Bibak} et al., ACM Trans. Algorithms 17, No. 3, Article No. 19, 38 p. (2021; Zbl 07475098) Full Text: DOI arXiv
Hassin, Refael; Leshenko, Nikita Greedy differencing edge-contraction heuristic for the max-cut problem. (English) Zbl 1525.90417 Oper. Res. Lett. 49, No. 3, 320-325 (2021). MSC: 90C35 05C40 90C59 PDFBibTeX XMLCite \textit{R. Hassin} and \textit{N. Leshenko}, Oper. Res. Lett. 49, No. 3, 320--325 (2021; Zbl 1525.90417) Full Text: DOI
Chang, Kung-Ching; Shao, Sihong; Zhang, Dong; Zhang, Weixi Lovász extension and graph cut. (English) Zbl 1490.90291 Commun. Math. Sci. 19, No. 3, 761-786 (2021). Reviewer: Roman Čada (Plzeň) MSC: 90C35 05C85 58E05 90C27 PDFBibTeX XMLCite \textit{K.-C. Chang} et al., Commun. Math. Sci. 19, No. 3, 761--786 (2021; Zbl 1490.90291) Full Text: DOI arXiv
Hojny, Christopher; Joormann, Imke; Lüthen, Hendrik; Schmidt, Martin Mixed-integer programming techniques for the connected max-\(k\)-cut problem. (English) Zbl 1473.90092 Math. Program. Comput. 13, No. 1, 75-132 (2021). MSC: 90C11 90C35 90C57 PDFBibTeX XMLCite \textit{C. Hojny} et al., Math. Program. Comput. 13, No. 1, 75--132 (2021; Zbl 1473.90092) Full Text: DOI
Brusco, Michael; Davis-Stober, Clintin P.; Steinley, Douglas Ising formulations of some graph-theoretic problems in psychological research: models and methods. (English) Zbl 1475.91275 J. Math. Psychol. 102, Article ID 102536, 18 p. (2021). MSC: 91E45 05C90 90C27 PDFBibTeX XMLCite \textit{M. Brusco} et al., J. Math. Psychol. 102, Article ID 102536, 18 p. (2021; Zbl 1475.91275) Full Text: DOI Link
Carlson, Charles; Kolla, Alexandra; Li, Ray; Mani, Nitya; Sudakov, Benny; Trevisan, Luca Lower bounds for max-cut in \(H\)-free graphs via semidefinite programming. (English) Zbl 1475.05094 SIAM J. Discrete Math. 35, No. 3, 1557-1568 (2021). Reviewer: I. M. Erusalimskiy (Rostow-na-Donu) MSC: 05C35 90C22 PDFBibTeX XMLCite \textit{C. Carlson} et al., SIAM J. Discrete Math. 35, No. 3, 1557--1568 (2021; Zbl 1475.05094) Full Text: DOI arXiv
Nguyen, Viet Hung; Minoux, Michel Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results. (English) Zbl 1471.90158 Optim. Lett. 15, No. 4, 1041-1060 (2021). MSC: 90C35 90C11 90C57 PDFBibTeX XMLCite \textit{V. H. Nguyen} and \textit{M. Minoux}, Optim. Lett. 15, No. 4, 1041--1060 (2021; Zbl 1471.90158) Full Text: DOI Link
Figueira, Diego Containment of UC2RPQ: the hard and easy cases. (English) Zbl 07650987 Lutz, Carsten (ed.) et al., 23rd international conference on database theory, ICDT 2020, Copenhagen, Denmark, March 30 – April 2, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 155, Article 9, 18 p. (2020). MSC: 68P15 PDFBibTeX XMLCite \textit{D. Figueira}, LIPIcs -- Leibniz Int. Proc. Inform. 155, Article 9, 18 p. (2020; Zbl 07650987) Full Text: DOI
Carlson, Charles; Kolla, Alexandra; Li, Ray; Mani, Nitya; Sudakov, Benny; Trevisan, Luca Lower bounds for max-cut via semidefinite programming. (English) Zbl 07600797 Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 479-490 (2020). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{C. Carlson} et al., Lect. Notes Comput. Sci. 12118, 479--490 (2020; Zbl 07600797) Full Text: DOI
Bhangale, Amey; Khot, Subhash Simultaneous max-cut is harder to approximate than max-cut. (English) Zbl 07561737 Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 9, 15 p. (2020). MSC: 68Q25 PDFBibTeX XMLCite \textit{A. Bhangale} and \textit{S. Khot}, LIPIcs -- Leibniz Int. Proc. Inform. 169, Article 9, 15 p. (2020; Zbl 07561737) Full Text: DOI
Chaourar, Brahim Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\). (English) Zbl 1467.90049 J. Comb. Optim. 40, No. 4, 869-875 (2020). MSC: 90C27 PDFBibTeX XMLCite \textit{B. Chaourar}, J. Comb. Optim. 40, No. 4, 869--875 (2020; Zbl 1467.90049) Full Text: DOI
Chen, Xi; Guo, Chenghao; Vlatakis-Gkaragkounis, Emmanouil V.; Yannakakis, Mihalis; Zhang, Xinzhi Smoothed complexity of local max-cut and binary max-CSP. (English) Zbl 07298309 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 1052-1065 (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{X. Chen} et al., in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 1052--1065 (2020; Zbl 07298309) Full Text: DOI arXiv
Mohanty, Sidhanth; Raghavendra, Prasad; Xu, Jeff Lifting sum-of-squares lower bounds: degree-2 to degree-4. (English) Zbl 07298292 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 840-853 (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Mohanty} et al., in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 840--853 (2020; Zbl 07298292) Full Text: DOI arXiv
Gaar, Elisabeth; Rendl, Franz A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring. (English) Zbl 1450.90022 Math. Program. 183, No. 1-2 (B), 283-308 (2020). MSC: 90C22 90C27 PDFBibTeX XMLCite \textit{E. Gaar} and \textit{F. Rendl}, Math. Program. 183, No. 1--2 (B), 283--308 (2020; Zbl 1450.90022) Full Text: DOI arXiv
Deza, Michel; Dutour Sikirić, Mathieu Generalized cut and metric polytopes of graphs and simplicial complexes. (English) Zbl 1442.05253 Optim. Lett. 14, No. 2, 273-289 (2020). MSC: 05E45 52B12 90C27 90C57 PDFBibTeX XMLCite \textit{M. Deza} and \textit{M. Dutour Sikirić}, Optim. Lett. 14, No. 2, 273--289 (2020; Zbl 1442.05253) Full Text: DOI arXiv
Jarre, Florian; Lieder, Felix; Liu, Ya-Feng; Lu, Cheng Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting. (English) Zbl 1464.90050 J. Glob. Optim. 76, No. 4, 913-932 (2020). MSC: 90C20 90C22 PDFBibTeX XMLCite \textit{F. Jarre} et al., J. Glob. Optim. 76, No. 4, 913--932 (2020; Zbl 1464.90050) Full Text: DOI
Nayak, Rupaj Kumar; Mohanty, Nirmalya Kumar Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation. (English) Zbl 1441.90093 J. Comb. Optim. 39, No. 3, 792-825 (2020). MSC: 90C09 90C20 PDFBibTeX XMLCite \textit{R. K. Nayak} and \textit{N. K. Mohanty}, J. Comb. Optim. 39, No. 3, 792--825 (2020; Zbl 1441.90093) Full Text: DOI
Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav Fixed-parameter tractable algorithm and polynomial kernel for Max-Cut Above Spanning Tree. (English) Zbl 1434.68748 Theory Comput. Syst. 64, No. 1, 62-100 (2020). MSC: 68W40 05C85 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Madathil} et al., Theory Comput. Syst. 64, No. 1, 62--100 (2020; Zbl 1434.68748) Full Text: DOI
Yang, Qingzhi; Li, Yiyong; Huang, Pengfei A novel formulation of the max-cut problem and related algorithm. (English) Zbl 1433.90106 Appl. Math. Comput. 371, Article ID 124970, 6 p. (2020). MSC: 90C20 90C26 90C35 90C22 90C27 PDFBibTeX XMLCite \textit{Q. Yang} et al., Appl. Math. Comput. 371, Article ID 124970, 6 p. (2020; Zbl 1433.90106) Full Text: DOI
Gharibian, Sevag; Parekh, Ojas Almost optimal classical approximation algorithms for a quantum generalization of max-cut. (English) Zbl 07650098 Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 31, 17 p. (2019). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{S. Gharibian} and \textit{O. Parekh}, LIPIcs -- Leibniz Int. Proc. Inform. 145, Article 31, 17 p. (2019; Zbl 07650098) Full Text: DOI arXiv
Austrin, Per; Stankovic, Aleksa Global cardinality constraints make approximating some max-2-CSPs harder. (English) Zbl 07650091 Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 24, 17 p. (2019). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{P. Austrin} and \textit{A. Stankovic}, LIPIcs -- Leibniz Int. Proc. Inform. 145, Article 24, 17 p. (2019; Zbl 07650091) Full Text: DOI arXiv
O’Donnell, Ryan; Schramm, Tselil Sherali-Adams strikes back. (English) Zbl 1528.68318 Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 8, 30 p. (2019). MSC: 68R10 05C50 05C80 68Q25 90C05 90C27 90C35 PDFBibTeX XMLCite \textit{R. O'Donnell} and \textit{T. Schramm}, LIPIcs -- Leibniz Int. Proc. Inform. 137, Article 8, 30 p. (2019; Zbl 1528.68318) Full Text: DOI
Loebl, Martin The precise complexity of finding rainbow even matchings. (English) Zbl 1434.68189 Ćirić, Miroslav (ed.) et al., Algebraic informatics. 8th international conference, CAI 2019, Niš, Serbia, June 30 – July 4, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11545, 190-201 (2019). MSC: 68Q17 05C70 68Q25 PDFBibTeX XMLCite \textit{M. Loebl}, Lect. Notes Comput. Sci. 11545, 190--201 (2019; Zbl 1434.68189) Full Text: DOI
Kobayashi, Yasuaki; Kobayashi, Yusuke; Miyazaki, Shuichi; Tamaki, Suguru An improved fixed-parameter algorithm for max-cut parameterized by crossing number. (English) Zbl 07173542 Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11638, 327-338 (2019). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{Y. Kobayashi} et al., Lect. Notes Comput. Sci. 11638, 327--338 (2019; Zbl 07173542) Full Text: DOI arXiv
Gaar, Elisabeth; Rendl, Franz A bundle approach for SDPs with exact subgraph constraints. (English) Zbl 1436.90100 Lodi, Andrea (ed.) et al., Integer programming and combinatorial optimization. 20th international conference, IPCO 2019, Ann Arbor, MI, USA, May 22–24, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11480, 205-218 (2019). MSC: 90C22 90C35 PDFBibTeX XMLCite \textit{E. Gaar} and \textit{F. Rendl}, Lect. Notes Comput. Sci. 11480, 205--218 (2019; Zbl 1436.90100) Full Text: DOI arXiv
Kapralov, Michael; Krachun, Dmitry An optimal space lower bound for approximating MAX-CUT. (English) Zbl 1433.68621 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 277-288 (2019). MSC: 68W27 68Q17 68R10 68W20 68W25 PDFBibTeX XMLCite \textit{M. Kapralov} and \textit{D. Krachun}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 277--288 (2019; Zbl 1433.68621) Full Text: DOI arXiv
Furini, Fabio; Traversi, Emiliano Theoretical and computational study of several linearisation techniques for binary quadratic problems. (English) Zbl 1434.90115 Ann. Oper. Res. 279, No. 1-2, 387-411 (2019). MSC: 90C20 90C09 PDFBibTeX XMLCite \textit{F. Furini} and \textit{E. Traversi}, Ann. Oper. Res. 279, No. 1--2, 387--411 (2019; Zbl 1434.90115) Full Text: DOI Link
Kawarabayashi, Ken-Ichi; Schwartzman, Gregory Adapting local sequential algorithms to the distributed setting. (English) Zbl 1497.68566 Schmid, Ulrich (ed.) et al., 32nd international symposium on distributed computing, DISC 2018, New Orleans, Louisiana, USA, October 15–19, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 121, Article 35, 17 p. (2018). MSC: 68W15 68R10 68W20 68W25 PDFBibTeX XMLCite \textit{K.-I. Kawarabayashi} and \textit{G. Schwartzman}, LIPIcs -- Leibniz Int. Proc. Inform. 121, Article 35, 17 p. (2018; Zbl 1497.68566) Full Text: DOI arXiv
Dunning, Iain; Gupta, Swati; Silberholz, John What works best when? A systematic evaluation of heuristics for max-cut and QUBO. (English) Zbl 1528.90288 INFORMS J. Comput. 30, No. 3, 608-624 (2018). MSC: 90C59 90-04 PDFBibTeX XMLCite \textit{I. Dunning} et al., INFORMS J. Comput. 30, No. 3, 608--624 (2018; Zbl 1528.90288) Full Text: DOI Link
Xiu, Yu; Shen, Weiwei; Wang, Zhongqun; Liu, Sanmin; Wang, Jun Multiple graph regularized graph transduction via greedy gradient Max-Cut. (English) Zbl 1436.68316 Inf. Sci. 423, 187-199 (2018). MSC: 68T05 68R10 PDFBibTeX XMLCite \textit{Y. Xiu} et al., Inf. Sci. 423, 187--199 (2018; Zbl 1436.68316) Full Text: DOI
Koutecký, Martin; Lee, Jon; Nagarajan, Viswanath; Shen, Xiangkun Approximating max-cut under graph-MSO constraints. (English) Zbl 1476.90340 Oper. Res. Lett. 46, No. 6, 592-598 (2018). MSC: 90C35 05C85 90C39 PDFBibTeX XMLCite \textit{M. Koutecký} et al., Oper. Res. Lett. 46, No. 6, 592--598 (2018; Zbl 1476.90340) Full Text: DOI arXiv
Kaparis, Konstantinos; Letchford, Adam N. A note on the 2-circulant inequalities for the MAX-cut problem. (English) Zbl 1452.90269 Oper. Res. Lett. 46, No. 4, 443-447 (2018). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{K. Kaparis} and \textit{A. N. Letchford}, Oper. Res. Lett. 46, No. 4, 443--447 (2018; Zbl 1452.90269) Full Text: DOI Link
Braun, Gábor; Pokutta, Sebastian; Roy, Aurko Strong reductions for extended formulations. (English) Zbl 1411.90211 Math. Program. 172, No. 1-2 (B), 591-620 (2018). MSC: 90C05 68Q17 PDFBibTeX XMLCite \textit{G. Braun} et al., Math. Program. 172, No. 1--2 (B), 591--620 (2018; Zbl 1411.90211) Full Text: DOI arXiv
Baïou, Mourad; Barahona, Francisco Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. (English) Zbl 1406.90102 Math. Program. 172, No. 1-2 (B), 59-75 (2018). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Baïou} and \textit{F. Barahona}, Math. Program. 172, No. 1--2 (B), 59--75 (2018; Zbl 1406.90102) Full Text: DOI
Saurabh, Saket; Zehavi, Meirav \((k,n-k)\)-Max-Cut: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel. (English) Zbl 1406.90122 Algorithmica 80, No. 12, 3844-3860 (2018). MSC: 90C35 PDFBibTeX XMLCite \textit{S. Saurabh} and \textit{M. Zehavi}, Algorithmica 80, No. 12, 3844--3860 (2018; Zbl 1406.90122) Full Text: DOI
Brouwer, Andries E.; Cioabă, Sebastian M.; Ihringer, Ferdinand; McGinnis, Matt The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters. (English) Zbl 1397.05098 J. Comb. Theory, Ser. B 133, 88-121 (2018). MSC: 05C50 05C12 PDFBibTeX XMLCite \textit{A. E. Brouwer} et al., J. Comb. Theory, Ser. B 133, 88--121 (2018; Zbl 1397.05098) Full Text: DOI arXiv Link
Gishboliner, Lior; Krivelevich, Michael; Kronenberg, Gal On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. (English) Zbl 1394.05033 Random Struct. Algorithms 52, No. 4, 545-559 (2018). MSC: 05C15 05C80 PDFBibTeX XMLCite \textit{L. Gishboliner} et al., Random Struct. Algorithms 52, No. 4, 545--559 (2018; Zbl 1394.05033) Full Text: DOI arXiv
Jagannath, Aukosh; Ko, Justin; Sen, Subhabrata MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass. (English) Zbl 1423.90227 Ann. Appl. Probab. 28, No. 3, 1536-1572 (2018). MSC: 90C27 82D30 82B44 60K35 60G15 90C06 PDFBibTeX XMLCite \textit{A. Jagannath} et al., Ann. Appl. Probab. 28, No. 3, 1536--1572 (2018; Zbl 1423.90227) Full Text: DOI arXiv Euclid
Etscheid, Michael; Mnich, Matthias Linear kernels and linear-time algorithms for finding large cuts. (English) Zbl 1396.68056 Algorithmica 80, No. 9, 2574-2615 (2018). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{M. Etscheid} and \textit{M. Mnich}, Algorithmica 80, No. 9, 2574--2615 (2018; Zbl 1396.68056) Full Text: DOI
Wu, Shufei; Hou, Jianfeng Partitioning dense uniform hypergraphs. (English) Zbl 1386.05158 J. Comb. Optim. 35, No. 1, 48-63 (2018). MSC: 05C70 05C42 05C35 05C65 PDFBibTeX XMLCite \textit{S. Wu} and \textit{J. Hou}, J. Comb. Optim. 35, No. 1, 48--63 (2018; Zbl 1386.05158) Full Text: DOI
Al-Homidan, Suliman Global convergence of the alternating projection method for the max-cut relaxation problem. (English) Zbl 1488.49031 Filomat 31, No. 3, 737-746 (2017). MSC: 49J45 91G60 PDFBibTeX XMLCite \textit{S. Al-Homidan}, Filomat 31, No. 3, 737--746 (2017; Zbl 1488.49031) Full Text: DOI
Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Sucupira, Rubens Improved kernels for Signed Max Cut parameterized above lower bound on \((r,\ell)\)-graphs. (English) Zbl 1400.05105 Discrete Math. Theor. Comput. Sci. 19, No. 1, Paper No. 14, 20 p. (2017). MSC: 05C22 05C85 05C10 PDFBibTeX XMLCite \textit{L. Faria} et al., Discrete Math. Theor. Comput. Sci. 19, No. 1, Paper No. 14, 20 p. (2017; Zbl 1400.05105) Full Text: arXiv Link
Nguyen, Viet Hung; Minoux, Michel; Nguyen, Dang Phuong Reduced-size formulations for metric and cut polyhedra in sparse graphs. (English) Zbl 1388.05106 Networks 69, No. 1, 142-150 (2017). MSC: 05C42 PDFBibTeX XMLCite \textit{V. H. Nguyen} et al., Networks 69, No. 1, 142--150 (2017; Zbl 1388.05106) Full Text: DOI Link
Kim, Sunyoung; Kojima, Masakazu Binary quadratic optimization problems that are difficult to solve by conic relaxations. (English) Zbl 1387.90175 Discrete Optim. 24, 170-183 (2017). MSC: 90C20 90C22 90C10 PDFBibTeX XMLCite \textit{S. Kim} and \textit{M. Kojima}, Discrete Optim. 24, 170--183 (2017; Zbl 1387.90175) Full Text: DOI
Sucupira, Rubens; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S. Maximum cuts in edge-colored graphs. (English) Zbl 1383.05122 Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 87-92 (2017). MSC: 05C15 05C10 68Q25 PDFBibTeX XMLCite \textit{R. Sucupira} et al., Electron. Notes Discrete Math. 62, 87--92 (2017; Zbl 1383.05122) Full Text: DOI arXiv
Adams, Elspeth; Anjos, Miguel F. Exact separation of \(k\)-projection polytope constraints. (English) Zbl 1383.49014 Takáč, Martin (ed.) et al., Modeling and optimization: theory and applications. MOPTA, Bethlehem, PA, USA, August 17–19, 2016. Selected contributions. Cham: Springer (ISBN 978-3-319-66615-0/hbk; 978-3-319-66616-7/ebook). Springer Proceedings in Mathematics & Statistics 213, 119-141 (2017). MSC: 49J45 90C11 PDFBibTeX XMLCite \textit{E. Adams} and \textit{M. F. Anjos}, Springer Proc. Math. Stat. 213, 119--141 (2017; Zbl 1383.49014) Full Text: DOI
Nicodemos, Diego; Stehlík, Matěj Packing and covering odd cycles in cubic plane graphs with small faces. (English) Zbl 1378.05034 Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 925-931 (2017). MSC: 05C10 05C69 PDFBibTeX XMLCite \textit{D. Nicodemos} and \textit{M. Stehlík}, Electron. Notes Discrete Math. 61, 925--931 (2017; Zbl 1378.05034) Full Text: DOI
Dhara, Souvik; Mukherjee, Debankur; Sen, Subhabrata Phase transitions of extremal cuts for the configuration model. (English) Zbl 1372.05198 Electron. J. Probab. 22, Paper No. 86, 29 p. (2017). MSC: 05C80 05C85 PDFBibTeX XMLCite \textit{S. Dhara} et al., Electron. J. Probab. 22, Paper No. 86, 29 p. (2017; Zbl 1372.05198) Full Text: DOI arXiv Euclid
Dembo, Amir; Montanari, Andrea; Sen, Subhabrata Extremal cuts of sparse random graphs. (English) Zbl 1372.05196 Ann. Probab. 45, No. 2, 1190-1217 (2017). MSC: 05C80 05C42 68R10 82B44 PDFBibTeX XMLCite \textit{A. Dembo} et al., Ann. Probab. 45, No. 2, 1190--1217 (2017; Zbl 1372.05196) Full Text: DOI arXiv Euclid
Hou, Jianfeng; Zeng, Qinghou Judicious partitioning of hypergraphs with edges of size at most 2. (English) Zbl 1371.05229 Comb. Probab. Comput. 26, No. 2, 267-284 (2017). MSC: 05C70 05C65 05C12 05C35 05C75 68Q25 PDFBibTeX XMLCite \textit{J. Hou} and \textit{Q. Zeng}, Comb. Probab. Comput. 26, No. 2, 267--284 (2017; Zbl 1371.05229) Full Text: DOI
Angel, Omer; Bubeck, Sébastien; Peres, Yuval; Wei, Fan Local max-cut in smoothed polynomial time. (English) Zbl 1369.68226 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 429-437 (2017). MSC: 68Q25 68T20 91A10 PDFBibTeX XMLCite \textit{O. Angel} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 429--437 (2017; Zbl 1369.68226) Full Text: DOI arXiv
Hou, Jianfeng; Zeng, Qinghou On a problem of judicious \(k\)-partitions of graphs. (English) Zbl 1367.05168 J. Graph Theory 85, No. 3, 619-643 (2017). MSC: 05C70 PDFBibTeX XMLCite \textit{J. Hou} and \textit{Q. Zeng}, J. Graph Theory 85, No. 3, 619--643 (2017; Zbl 1367.05168) Full Text: DOI
Zeng, Qing Hou; Hou, Jian Feng; Deng, Jin; Lei, Xia Biased partitions and judicious \(k\)-partitions of graphs. (English) Zbl 1362.05108 Acta Math. Sin., Engl. Ser. 33, No. 5, 668-680 (2017). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{Q. H. Zeng} et al., Acta Math. Sin., Engl. Ser. 33, No. 5, 668--680 (2017; Zbl 1362.05108) Full Text: DOI
Ma, Fuda; Hao, Jin-Kao A multiple search operator heuristic for the max-k-cut problem. (English) Zbl 1357.90122 Ann. Oper. Res. 248, No. 1-2, 365-403 (2017). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{F. Ma} and \textit{J.-K. Hao}, Ann. Oper. Res. 248, No. 1--2, 365--403 (2017; Zbl 1357.90122) Full Text: DOI arXiv
Hungerländer, Philipp New semidefinite programming relaxations for the linear ordering and the traveling salesman problem. (English) Zbl 1358.90117 Discrete Appl. Math. 217, Part 1, 19-39 (2017). MSC: 90C27 PDFBibTeX XMLCite \textit{P. Hungerländer}, Discrete Appl. Math. 217, Part 1, 19--39 (2017; Zbl 1358.90117) Full Text: DOI
Lasserre, Jean B. A MAX-CUT formulation of 0/1 programs. (English) Zbl 1408.90222 Oper. Res. Lett. 44, No. 2, 158-164 (2016). MSC: 90C20 90C10 90C22 PDFBibTeX XMLCite \textit{J. B. Lasserre}, Oper. Res. Lett. 44, No. 2, 158--164 (2016; Zbl 1408.90222) Full Text: DOI arXiv
Etscheid, Michael; Mnich, Matthias Linear kernels and linear-time algorithms for finding large cuts. (English) Zbl 1398.68229 Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 31, 13 p. (2016). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{M. Etscheid} and \textit{M. Mnich}, LIPIcs -- Leibniz Int. Proc. Inform. 64, Article 31, 13 p. (2016; Zbl 1398.68229) Full Text: DOI
Sun, Ting; Li, Gaidi; Xu, Wenqing Approximation algorithms for max cut and max bisection problems using semidefinite programming relaxations. (Chinese. English summary) Zbl 1374.90425 Oper. Res. Trans. 20, No. 3, 21-32 (2016). MSC: 90C59 90C22 90C27 PDFBibTeX XMLCite \textit{T. Sun} et al., Oper. Res. Trans. 20, No. 3, 21--32 (2016; Zbl 1374.90425) Full Text: DOI
Veiga Pocai, Rafael The complexity of SIMPLE MAX-CUT on comparability graphs. (English) Zbl 1356.05093 Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 161-164 (2016). MSC: 05C60 05C35 PDFBibTeX XMLCite \textit{R. Veiga Pocai}, Electron. Notes Discrete Math. 55, 161--164 (2016; Zbl 1356.05093) Full Text: DOI
De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F. A nonmonotone GRASP. (English) Zbl 1349.90710 Math. Program. Comput. 8, No. 3, 271-309 (2016). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. De Santis} et al., Math. Program. Comput. 8, No. 3, 271--309 (2016; Zbl 1349.90710) Full Text: DOI Link
Guenin, Bertrand; Stuive, Leanne Single commodity-flow algorithms for lifts of graphic and cographic matroids. (English) Zbl 1344.05040 SIAM J. Discrete Math. 30, No. 3, 1775-1797 (2016). MSC: 05B35 05C22 90C05 90C47 68Q25 PDFBibTeX XMLCite \textit{B. Guenin} and \textit{L. Stuive}, SIAM J. Discrete Math. 30, No. 3, 1775--1797 (2016; Zbl 1344.05040) Full Text: DOI Link
Baïou, Mourad; Barahona, Francisco Sparsest-cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. (English) Zbl 1419.90110 Louveaux, Quentin (ed.) et al., Integer programming and combinatorial optimization. 18th international conference, IPCO 2016, Liège, Belgium, June 1–3, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9682, 63-76 (2016). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{M. Baïou} and \textit{F. Barahona}, Lect. Notes Comput. Sci. 9682, 63--76 (2016; Zbl 1419.90110) Full Text: DOI
Mu, Xuewen; Liu, Wenlong An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions. (English) Zbl 1345.90060 Optim. Lett. 10, No. 3, 485-497 (2016). MSC: 90C10 90C20 PDFBibTeX XMLCite \textit{X. Mu} and \textit{W. Liu}, Optim. Lett. 10, No. 3, 485--497 (2016; Zbl 1345.90060) Full Text: DOI
Lin, Geng; Zhu, Wenxing A memetic algorithm for the max-cut problem. (English) Zbl 1453.68139 Int. J. Comput. Sci. Math. 6, No. 1, 69-77 (2015). MSC: 68R10 68T20 68W50 90C27 90C59 PDFBibTeX XMLCite \textit{G. Lin} and \textit{W. Zhu}, Int. J. Comput. Sci. Math. 6, No. 1, 69--77 (2015; Zbl 1453.68139) Full Text: DOI
Kogan, Dmitry; Krauthgamer, Robert Sketching cuts in graphs and hypergraphs. (English) Zbl 1365.68469 Proceedings of the 6th conference on innovations in theoretical computer science, ITCS’15, Rehovot, Israel, January 11–13, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3333-7). 367-376 (2015). MSC: 68W25 05C65 05C85 68Q25 PDFBibTeX XMLCite \textit{D. Kogan} and \textit{R. Krauthgamer}, in: Proceedings of the 6th conference on innovations in theoretical computer science, ITCS'15, Rehovot, Israel, January 11--13, 2015. New York, NY: Association for Computing Machinery (ACM). 367--376 (2015; Zbl 1365.68469) Full Text: DOI arXiv
Xie, Min; Yang, Fan; Zeng, Xuan A partition-based IP protection algorithm for analog circuits. (Chinese. English summary) Zbl 1349.94170 J. Fudan Univ., Nat. Sci. 54, No. 5, 559-568 (2015). MSC: 94C05 94C15 PDFBibTeX XMLCite \textit{M. Xie} et al., J. Fudan Univ., Nat. Sci. 54, No. 5, 559--568 (2015; Zbl 1349.94170) Full Text: DOI
Soto, José A. Improved analysis of a Max-Cut algorithm based on spectral partitioning. (English) Zbl 1331.68297 SIAM J. Discrete Math. 29, No. 1, 259-268 (2015). MSC: 68W25 05C50 68W40 PDFBibTeX XMLCite \textit{J. A. Soto}, SIAM J. Discrete Math. 29, No. 1, 259--268 (2015; Zbl 1331.68297) Full Text: DOI
DeMarco, B.; Kahn, J. Mantel’s theorem for random graphs. (English) Zbl 1328.05169 Random Struct. Algorithms 47, No. 1, 59-72 (2015). Reviewer: David B. Penman (Colchester) MSC: 05C80 05C35 PDFBibTeX XMLCite \textit{B. DeMarco} and \textit{J. Kahn}, Random Struct. Algorithms 47, No. 1, 59--72 (2015; Zbl 1328.05169) Full Text: DOI arXiv
Lieder, Felix; Rad, Fatemeh Bani Asadi; Jarre, Florian Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques. (English) Zbl 1346.90603 Comput. Optim. Appl. 61, No. 3, 669-688 (2015). MSC: 90C09 90C22 PDFBibTeX XMLCite \textit{F. Lieder} et al., Comput. Optim. Appl. 61, No. 3, 669--688 (2015; Zbl 1346.90603) Full Text: DOI
Mossel, Elchanan; Neeman, Joe Robust optimality of Gaussian noise stability. (English) Zbl 1384.60062 J. Eur. Math. Soc. (JEMS) 17, No. 2, 433-482 (2015). Reviewer: Ruhollah Jahanipur (Kashan) MSC: 60E15 26D10 68Q87 60G10 PDFBibTeX XMLCite \textit{E. Mossel} and \textit{J. Neeman}, J. Eur. Math. Soc. (JEMS) 17, No. 2, 433--482 (2015; Zbl 1384.60062) Full Text: DOI arXiv
Li, Li Selected applications of convex optimization. (English) Zbl 1321.90005 Springer Optimization and Its Applications 103. Beijing: Tsinghua University Press; Berlin: Springer (ISBN 978-7-302-39029-9/pbk; 978-3-662-46355-0/pbk; 978-3-662-46356-7/ebook). x, 140 p. (2015). Reviewer: Rembert Reemtsen (Cottbus) MSC: 90-02 90C25 90C90 00A69 PDFBibTeX XMLCite \textit{L. Li}, Selected applications of convex optimization. Beijing: Tsinghua University Press; Berlin: Springer (2015; Zbl 1321.90005) Full Text: DOI
O’Donnell, Ryan Social choice, computational complexity, Gaussian geometry, and Boolean functions. (English) Zbl 1375.91074 Jang, Sun Young (ed.) et al., Proceedings of the International Congress of Mathematicians (ICM 2014), Seoul, Korea, August 13–21, 2014. Vol. IV: Invited lectures. Seoul: KM Kyung Moon Sa (ISBN 978-89-6105-807-0/hbk; 978-89-6105-803-2/set). 633-658 (2014). MSC: 91B14 68Q87 94C10 60G15 PDFBibTeX XMLCite \textit{R. O'Donnell}, in: Proceedings of the International Congress of Mathematicians (ICM 2014), Seoul, Korea, August 13--21, 2014. Vol. IV: Invited lectures. Seoul: KM Kyung Moon Sa. 633--658 (2014; Zbl 1375.91074) Full Text: arXiv
Letchford, Adam N.; Sørensen, Michael M. A new separation algorithm for the Boolean quadric and cut polytopes. (English) Zbl 1308.90209 Discrete Optim. 14, 61-71 (2014). MSC: 90C57 90C20 90C09 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{M. M. Sørensen}, Discrete Optim. 14, 61--71 (2014; Zbl 1308.90209) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket Almost optimal lower bounds for problems parameterized by clique-width. (English) Zbl 1306.05181 SIAM J. Comput. 43, No. 5, 1541-1563 (2014). MSC: 05C69 05C85 05C12 68R10 68Q17 68Q25 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Comput. 43, No. 5, 1541--1563 (2014; Zbl 1306.05181) Full Text: DOI Link
Lin, Geng; Zhu, Wenxing Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem. (English) Zbl 1307.90190 J. Oper. Res. Soc. China 2, No. 2, 237-262 (2014). MSC: 90C35 PDFBibTeX XMLCite \textit{G. Lin} and \textit{W. Zhu}, J. Oper. Res. Soc. China 2, No. 2, 237--262 (2014; Zbl 1307.90190) Full Text: DOI
Fan, Genghua; Hou, Jianfeng; Zeng, Qinghou A bound for judicious \(k\)-partitions of graphs. (English) Zbl 1303.05152 Discrete Appl. Math. 179, 86-99 (2014). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{G. Fan} et al., Discrete Appl. Math. 179, 86--99 (2014; Zbl 1303.05152) Full Text: DOI
Bonato, Thorsten; Jünger, Michael; Reinelt, Gerhard; Rinaldi, Giovanni Lifting and separation procedures for the cut polytope. (English) Zbl 1297.90133 Math. Program. 146, No. 1-2 (A), 351-378 (2014). MSC: 90C27 90C57 90C20 90C09 82D30 PDFBibTeX XMLCite \textit{T. Bonato} et al., Math. Program. 146, No. 1--2 (A), 351--378 (2014; Zbl 1297.90133) Full Text: DOI Link
Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket; Suchý, Ondřej Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. (English) Zbl 1312.68105 J. Comput. Syst. Sci. 80, No. 7, 1384-1403 (2014). MSC: 68Q25 05C40 05C85 PDFBibTeX XMLCite \textit{M. Mnich} et al., J. Comput. Syst. Sci. 80, No. 7, 1384--1403 (2014; Zbl 1312.68105) Full Text: DOI arXiv
Lange, Alexander R.; Radziszowski, Stanislaw P.; Xu, Xiaodong Use of MAX-CUT for Ramsey arrowing of triangles. (English) Zbl 1293.05113 J. Comb. Math. Comb. Comput. 88, 61-71 (2014). MSC: 05C15 05C75 05C55 90C22 PDFBibTeX XMLCite \textit{A. R. Lange} et al., J. Comb. Math. Comb. Comput. 88, 61--71 (2014; Zbl 1293.05113) Full Text: arXiv
Crowston, Robert; Jones, Mark; Muciaccia, Gabriele; Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket Polynomial kernels for \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. (English) Zbl 1359.68125 Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 43-54 (2013). MSC: 68Q25 05C60 05C85 PDFBibTeX XMLCite \textit{R. Crowston} et al., LIPIcs -- Leibniz Int. Proc. Inform. 24, 43--54 (2013; Zbl 1359.68125) Full Text: DOI arXiv
Wu, Qinghua; Hao, Jin-Kao Memetic search for the max-bisection problem. (English) Zbl 1349.90828 Comput. Oper. Res. 40, No. 1, 166-179 (2013). MSC: 90C35 90C59 05C22 PDFBibTeX XMLCite \textit{Q. Wu} and \textit{J.-K. Hao}, Comput. Oper. Res. 40, No. 1, 166--179 (2013; Zbl 1349.90828) Full Text: DOI
Pansu, Pierre Difficulty of approximation (after Khot, Kindler, Mossel, O’Donnell, …). (Difficulté d’approximation (d’après Khot, Kindler, Mossel, O’Donnell, …).) (French) Zbl 1448.68479 Séminaire Bourbaki. Volume 2011/2012. Exposés 1043–1058. Paris: Société Mathématique de France (SMF). Astérisque 352, 83-120, Exp. No. 1045 (2013). MSC: 68W25 68Q17 68R10 90C22 PDFBibTeX XMLCite \textit{P. Pansu}, Astérisque 352, 83--120, Exp. No. 1045 (2013; Zbl 1448.68479)