A MAX-CUT formulation of 0/1 programs
Year of publication: |
March 2016
|
---|---|
Authors: | Lasserre, Jean B. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 44.2016, 2, p. 158-164
|
Subject: | Linear and quadratic 0/1 programs | MAX-CUT problem | LP- and semidefinite relaxations | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
A note on the 2-circulant inequalities for the max-cut problem
Kaparis, Konstantinos, (2018)
-
Generalised 2-circulant inequalities for the max-cut problem
Kaparis, Konstantinos, (2022)
-
Optimal proactive monitor placement & scheduling for IoT networks
Mostafa, Basma, (2022)
- More ...
-
Linear Programming Formulation of MDPs in Countable State Space: The Multichain Case
Hordijk, Arie, (1994)
-
Integer programming, Barvinok's counting algorithm and Gomory relaxations
Lasserre, Jean B., (2004)
-
Solving the knapsack problem via Z-transform
Lasserre, Jean B., (2002)
- More ...