A note on the 2-circulant inequalities for the max-cut problem
Year of publication: |
July 2018
|
---|---|
Authors: | Kaparis, Konstantinos ; Letchford, Adam N. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 46.2018, 4, p. 443-447
|
Subject: | Max-cut problem | Polyhedral combinatorics | Branch-and-cut | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | USA | United States | Theorie | Theory |
-
Generalised 2-circulant inequalities for the max-cut problem
Kaparis, Konstantinos, (2022)
-
Optimizing over path-length matrices of unrooted binary trees
Catanzaro, Daniele, (2023)
-
On lifted cover inequalities : a new lifting procedure with unusual properties
Letchford, Adam N., (2019)
- More ...
-
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
Kaparis, Konstantinos, (2008)
-
Complexity results for the gap inequalities for the max-cut problem
Galli, Laura, (2012)
-
Local and global lifted cover inequalities for the 0–1 multidimensional knapsack problem
Kaparis, Konstantinos, (2008)
- More ...