Work

Improvable Knapsack Problems

Year: 2016

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1607.08338

Authors: Goerigk, Marc, Sabharwal, Yogish, Schöbel, Anita, Sen, Sandeep

Institutions: Lancaster University, IBM Research - India, Indian Institute of Technology Delhi

Language: English

Topic: Optimization and Packing Problems

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: green

Funders: Department of Science and Technology, Ministry of Science and Technology, India, Deutsche Forschungsgemeinschaft

OpenAlex ID: W2482575563

Cites: 28

Cited by:

Related to: 10