Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 1

first rewind previous Page / 1 next fast forward last

Search results

help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Publication available in full text mode
Content available

Approximate solutions to the multiple-choice knapsack problem by multiobjectivization and Chebyshev scalarization

100%
Bednarczuk E. M., Kaliszewski I., Miroforidis J.
Operations Research and Decisions
|
2024
|
vol. 34
|
issue 4
53-66
EN
The method BISSA, proposed by Bednarczuk, Miroforidis, and Pyzel, provides approximate solutions to the multiple-choice knapsack problem. To fathom the optimality gap that is left by BISSA, we present a method that starts from the BISSA solution and it is able to provide a better approximation and in consequence a tighter optimality gap. Like BISSA, the new method is based on the multiobjectivization of the multiple-choice knapsack problem but instead of the linear scalarization used in BISSA, it makes use of the Chebyshev scalarization. We validate the new method on the same set of problems as the one used to validate BISSA.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.