A note on upper bounds to the robust knapsack problem with discrete scenarios
Crossref DOI link: https://doi.org/10.1007/s10479-014-1618-2
Published Online: 2014-05-24
Published Print: 2014-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Goerigk, Marc
Text and Data Mining valid from 2014-05-24