Abstract
The knapsack problem (see expression (16.61)) is to maximize the total value of a collection of objects when the total weight g of those objects is limited. We denote the value of the object i by c i and the weight by g i .
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
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Mockus, J., Eddy, W., Mockus, A., Mockus, L., Reklaitis, G. (1997). Examples of Discrete Optimization. In: Bayesian Heuristic Approach to Discrete and Global Optimization. Nonconvex Optimization and Its Applications, vol 17. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2627-5_12
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2627-5_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4767-3
Online ISBN: 978-1-4757-2627-5
eBook Packages: Springer Book Archive