AIP Conference Proceedings [Author(s) NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA–2016): Proceedings of the 2nd International Conference “Numerical Computations: Theory and Algorithms” - Pizzo Calabro, Italy (19–25 June 2016)] - The upper bound on the complexity of branch-and-bound with cardinality bound for subset sum problem
Sin, Si Thu Thant, Posypkin, Mikhail, Kolpakov, RomanVolume:
1776
Year:
2016
Language:
english
DOI:
10.1063/1.4965330
File:
PDF, 119 KB
english, 2016