LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison

From MaRDI portal

(Redirected from Publication:2392866)

Jump to:navigation, search

MaRDI QID[[Item:|]]

Authors

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 )

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=LP_and_SDP_branch-and-cut_algorithms_for_the_minimum_graph_bisection_problem:_a_computational_comparison&oldid=78622475"