On relaxations of the max k-cut problem formulations
Year of publication: |
2023
|
---|---|
Authors: | Fakhimi, Ramin ; Validi, Hamidreza ; Hicks, Illya V. ; Terlaky, Tamás ; Zuluaga, Luis F. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 51.2023, 5, p. 521-527
|
Subject: | Continuous relaxation | Mixed integer optimization | Semidefinite optimization | The max -cut problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming |
-
When is rounding allowed in integer nonlinear optimization?
Hübner, Ruth, (2014)
-
Optimal classification trees with leaf-branch and binary constraints
Liu, Enhao, (2024)
-
Decision support system of truck routing and refueling : a dual-objective approach
Suzuki, Yoshinori, (2013)
- More ...
-
Maximizing engagement in large-scale social networks
Kroger, Samuel, (2024)
-
Comments on: Recent progress on the cominatorial diameter of polytopes and simplicial complexes
Terlaky, Tamás, (2013)
-
Terlaky, Tamás, (2017)
- More ...