Improvable Knapsack Problems

Goerigk, Marc and Sabharwal, Yogish and Schöbel, Anita and Sen, Sandeep (2016) Improvable Knapsack Problems. Working Paper. UNSPECIFIED.

Full text not available from this repository.

Abstract

We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Which items should be improved to which degree such that the resulting classic knapsack problem yields maximum profit? We present a detailed analysis for several cases of improvable knapsack problems, presenting constant factor approximation algorithms and two PTAS.

Item Type: Monograph (Working Paper)
Departments: Lancaster University Management School > Management Science
ID Code: 86066
Deposited By: ep_importer_pure
Deposited On: 27 Apr 2017 12:32
Refereed?: No
Published?: Published
Last Modified: 24 Jan 2020 05:04
URI: https://eprints.lancs.ac.uk/id/eprint/86066

Actions (login required)

View Item View Item