Abstract
A smuggler in the mountainous region of Profitania has n items in his cellar. If he sells an item i across the border, he makes a profit pi. However, the smuggler’s trade union only allows him to carry knapsacks with a maximum weight of M. If item i has weight wi, which of the items should he pack into the knapsack to maximize the profit from his next trip?
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Sanders, P., Mehlhorn, K., Dietzfelbinger, M., Dementiev, R. (2019). Generic Approaches to Optimization. In: Sequential and Parallel Algorithms and Data Structures. Springer, Cham. https://doi.org/10.1007/978-3-030-25209-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-25209-0_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-25208-3
Online ISBN: 978-3-030-25209-0
eBook Packages: Computer ScienceComputer Science (R0)