Amazon cover image
Image from Amazon.com

Knapsack problems

By: Contributor(s): Material type: TextTextPublication details: Springer 2004 New YorkDescription: xx, 546 p.; ill. Includes bibliographies and indexISBN:
  • 9783642073113
Subject(s): DDC classification:
  • 519.6 K3K6
Summary: Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the knapsack problem is easily understood even by a non-expert who will not suspect the presence of challenging research topics in this area at the first glance. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of interest such as exact algorithms, heuristics and approximation schemes. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and in the num¬ ber of knapsacks, as well as the modification of the problem structure concerning the available item set and the objective function, leads to a number of interesting variations of practical relevance which were the subject of intensive research during the last few years. Hence, two years ago the idea arose to produce a new monograph covering not only the most recent developments of the standard knapsack problem, but also giving a comprehensive treatment of the whole knapsack family including the siblings such as the subset sum problem and the bounded and unbounded knapsack problem, and also more distant relatives such as multidimensional, multiple, multiple-choice and quadratic knapsack problems in dedicated chapters. https://link.springer.com/book/10.1007/978-3-540-24777-7
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Item location Collection Shelving location Call number Status Date due Barcode
Books Vikram Sarabhai Library Rack 33-A / Slot 1682 (2nd Floor, East Wing) Non-fiction General Stacks 519.6 K3K6 (Browse shelf(Opens below)) Available 206364

Table of Contents

Chapter-1.Introduction
Chapter-2.Basic algorithmic concepts
Chapter-3.Advanced algorithmic concepts
Chapter-4.The subset sum problem
Chapter-5.Exact solution of the knapsack problem
Chapter-6.Approximation algorithms for the knapsack problem
Chapter-7.The bounded knapsack problem
Chapter-8.The unbounded knapsack problem
Chapter-9.Multidimensional knapsack problems
Chapter-10.Multiple knapsack problems
Chapter-11.The multiple-choice knapsack problem
Chapter-12.The quadratic knapsack problem
Chapter-13.Other knapsack problems
Chapter-14.Stochastic aspects of knapsack problems
Chapter-15.Some selected applications
Chapter-16.Introduction to np-completeness of knapsack problems


Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the knapsack problem is easily understood even by a non-expert who will not suspect the presence of challenging research topics in this area at the first glance. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of interest such as exact algorithms, heuristics and approximation schemes. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and in the num¬ ber of knapsacks, as well as the modification of the problem structure concerning the available item set and the objective function, leads to a number of interesting variations of practical relevance which were the subject of intensive research during the last few years. Hence, two years ago the idea arose to produce a new monograph covering not only the most recent developments of the standard knapsack problem, but also giving a comprehensive treatment of the whole knapsack family including the siblings such as the subset sum problem and the bounded and unbounded knapsack problem, and also more distant relatives such as multidimensional, multiple, multiple-choice and quadratic knapsack problems in dedicated chapters.


https://link.springer.com/book/10.1007/978-3-540-24777-7

There are no comments on this title.

to post a comment.