A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
From MaRDI portal
(Redirected from Publication:263189)
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 )