Comparative analysis of linear programming relaxations for the robust knapsack problem
Crossref DOI link: https://doi.org/10.1007/s10479-022-05161-w
Published Online: 2023-01-05
Published Print: 2023-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Joung, Seulgi
Oh, Seyoung
Lee, Kyungsik https://orcid.org/0000-0002-4543-2312
Funding for this research was provided by:
National Research Foundation of Korea (2021R1G1A1003653)
Text and Data Mining valid from 2023-01-05
Version of Record valid from 2023-01-05
Article History
Accepted: 15 December 2022
First Online: 5 January 2023
Declarations
:
: The authors declare that they have no conflict of interest.