Abstract
This chapter discusses the well-known knapsack problem. This problem is another classical problem and is quoted as often in the problem-solving literature as the traveling salesman problem of Chapter 6. According to the problem classification of the model theory approach, the knapsack problem is more difficult than the traveling salesman problem because the former is less structured than the latter. Since the target state is not well specified except that it should be an optimal state, the stopping condition of the knapsack problem requires an involved expression to secure optimality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2006). Knapsack Problem: I-C-O Problem. In: Klir, G.J. (eds) Foundations and Applications of Mis. IFSR International Series on Systems Science and Engineering, vol 24. Springer, New York, NY. https://doi.org/10.1007/978-0-387-35840-6_10
Download citation
DOI: https://doi.org/10.1007/978-0-387-35840-6_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-31414-3
Online ISBN: 978-0-387-35840-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)