A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
Crossref DOI link: https://doi.org/10.1007/s10589-019-00153-2
Published Online: 2019-11-14
Published Print: 2020-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kobayashi, Ken http://orcid.org/0000-0002-6609-7488
Takano, Yuich
Text and Data Mining valid from 2019-11-14
Version of Record valid from 2019-11-14
Article History
Received: 24 September 2018
First Online: 14 November 2019