A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
Year of publication: |
2011
|
---|---|
Authors: | Ghaddar, Bissan ; Anjos, Miguel F. ; Liers, Frauke |
Published in: |
Annals of operations research. - New York, NY [u.a.] : Springer Science + Business Media, ISSN 0254-5330, ZDB-ID 2526293. - Vol. 188.2011, 1, p. 155-175
|
Saved in:
Saved in favorites
Similar items by person
-
A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
Ghaddar, Bissan, (2011)
-
Special issue on energy networks
Anjos, Miguel F., (2022)
-
A Lagrangian decomposition approach for the pump scheduling problem in water networks
Ghaddar, Bissan, (2015)
- More ...