A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem

From MaRDI portal
(Redirected from Publication:646707)





No records found





Cited in

No records found








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item )