Branch-and-bound solves random binary IPs in poly(n)-time
Crossref DOI link: https://doi.org/10.1007/s10107-022-01895-4
Published Online: 2022-10-19
Published Print: 2023-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Dey, Santanu S.
Dubey, Yatharth http://orcid.org/0000-0002-3281-1102
Molinaro, Marco
Text and Data Mining valid from 2022-10-19
Version of Record valid from 2022-10-19
Article History
Received: 1 September 2021
Accepted: 6 September 2022
First Online: 19 October 2022
Declarations
:
: All authors declare that they have no conflicts of interest.