A recipe for semidefinite relaxation for (0,1)-quadratic programming : in memory of Svata Poljak
Year of publication: |
1995
|
---|---|
Authors: | Poljak, Svatopluk |
Other Persons: | Rendl, Franz (contributor) ; Wolkowicz, Henry (contributor) |
Published in: |
Journal of global optimization. - Dordrecht [u.a.] : Springer, ISSN 0925-5001, ZDB-ID 1074566-X. - Vol. 7.1995, 1, p. 51-73
|
Subject: | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Optimal proactive monitor placement & scheduling for IoT networks
Mostafa, Basma, (2022)
-
Eirinakis, Pavlos, (2024)
-
A hybrid ANN-MILP model for agile recovery production planning for PPE products under sharp demands
Babazadeh, Reza, (2025)
- More ...
-
Convex Relaxations of (0, 1)-Quadratic Programming
Poljak, Svatopluk, (1995)
-
Solving the max-cut problem using eigenvalues
Poljak, Svatopluk, (1991)
-
On the ultimate independence ratio of a graph
Hahn, Geňa, (1991)
- More ...