Solving the max-cut problem using eigenvalues
Year of publication: |
1991
|
---|---|
Authors: | Poljak, Svatopluk ; Rendl, Franz |
Publisher: |
Bonn : Forschungsinst. für Diskrete Mathematik [u.a.] |
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
Biogeography-based optimisation for flexible manufacturing system scheduling problem
Shahla Paslar, (2015)
-
Pattern mining-based pruning strategies in stochastic local searches for scheduling problems
Laurent, Arnaud, (2022)
-
Cui, Haijuan, (2022)
- More ...
-
A recipe for semidefinite relaxation for (0,1)-quadratic programming : in memory of Svata Poljak
Poljak, Svatopluk, (1995)
-
Convex Relaxations of (0, 1)-Quadratic Programming
Poljak, Svatopluk, (1995)
-
On the ultimate independence ratio of a graph
Hahn, Geňa, (1991)
- More ...