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 |
-
When is rounding allowed in integer nonlinear optimization?
Hübner, Ruth, (2014)
-
Integer linear programming models for the skiving stock problem
Martinovic, John, (2016)
-
An improved integer linear programming formulation for the closest 0-1 string problem
Arbib, Claudio, (2017)
- More ...
-
The optimal design of low-latency virtual backbones
Validi, Hamidreza, (2020)
-
Imposing contiguity constraints in political districting models
Validi, Hamidreza, (2022)
-
Optimal design of vaccination policies : a case study for Newfoundland and Labrador
Khoshbakhtian, Faraz, (2024)
- More ...