A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
Crossref DOI link: https://doi.org/10.1007/s11590-017-1125-x
Published Online: 2017-03-08
Published Print: 2018-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chen, Wei-An
Zhu, Zhen
Kong, Nan
Funding for this research was provided by:
Air Force Office of Scientific Research (FA9550-08-1-0268)
Text and Data Mining valid from 2017-03-08
Version of Record valid from 2017-03-08
Article History
Received: 10 October 2016
Accepted: 26 February 2017
First Online: 8 March 2017