A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
Crossref DOI link: https://doi.org/10.1007/s10107-015-0874-5
Published Online: 2015-02-21
Published Print: 2016-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kim, Sunyoung
Kojima, Masakazu
Toh, Kim-Chuan
Text and Data Mining valid from 2015-02-21