A note on the Lasserre hierarchy for different formulations of the maximum independent set problem
Year of publication: |
2021
|
---|---|
Authors: | Anjos, Miguel F. ; Emine, Y. ; Lodi, Andrea ; Sun, Z. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 1, p. 30-34
|
Subject: | Maximum independent set | Polynomial optimization | Dual bounds | Lasserre hierarchy | Theorie | Theory | Hierarchie | Hierarchy | Mathematische Optimierung | Mathematical programming |
-
Klerk, Etienne de, (2020)
-
Klerk, Etienne de, (2018)
-
Bound-constrained polynomial optimization using only elementary calculations
Klerk, Etienne de, (2017)
- More ...
-
Anjos, Miguel F., (2020)
-
Special issue on "continuous optimization and applications in machine learning and data analytics"
Anjos, Miguel F., (2020)
-
Proofs of unsatisfiability via semidefinite programming
Anjos, Miguel F., (2004)
- More ...