Skip to main content
One Stop
MyU
Lock
Authentication required
Search Libraries services
Libraries
UMedia
Search
Help
About
Contact
back to search
A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem
Related Items
The Algebraic Degree o...
Linear System Theory a...
From the stable set pr...
The Branch-and-Cut Alg...
Semidefinite Programming
Polynomial Optimal Con...
About This Item
Details
Cite This Item
JSON Results Page