The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Reducing the 0-1 Knapsack Problem with a Single Continuous Variable to the Standard 0-1 Knapsack Problem
Abstract
The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or upper bound, respectively. This paper concerns techniques in order to reduce several variants of KPC to KP which enables the authors to employ approaches for KP. The authors propose both, an equivalent reformulation and a heuristic one bringing along less computational effort. The authors show that the heuristic reformulation can be customized in order to provide solutions having an objective value arbitrarily close to the one of the original problem.
Related Content
|
Efigenia Madalena Mario Semente, Ricartha B. Haragaes.
© 2024.
23 pages.
|
|
.
© 2024.
|
|
Julian Scott Yeomans.
© 2023.
20 pages.
|
|
Brian J. Galli, Fuwei Qiu.
© 2023.
9 pages.
|
|
Sheunesu Brandon Shamuyarira, Trust Tawanda, Elias Munapo.
© 2023.
17 pages.
|
|
Basiru Adetomiwa, Bosede Olutoyin Akintola, Rasaki Oluwole Ejiwoye, Adeeko Christy Olabisi.
© 2023.
15 pages.
|
|
Hana O. A. Al-Omar.
© 2023.
20 pages.
|
|
|