printlogo
ETH Zuerich - Homepage
Systems Optimization (SOP)
 
Search

Wichtiger Hinweis:
Diese Website wird in älteren Versionen von Netscape ohne graphische Elemente dargestellt. Die Funktionalität der Website ist aber trotzdem gewährleistet. Wenn Sie diese Website regelmässig benutzen, empfehlen wir Ihnen, auf Ihrem Computer einen aktuellen Browser zu installieren. Weitere Informationen finden Sie auf
folgender Seite.

Important Note:
The content in this site is accessible to any browser or Internet device, however, some graphics will display correctly only in the newer versions of Netscape. To get the most out of our site we suggest you upgrade to the latest Netscape.
More information

ETH Zürich - D-ITET - TIK - SOP - PISA - Variators - Knapsack
print page
  
this webpage might no longer be updated more...

Knapsack

Generally, a 0/1 knapsack problem consists of a set of items, weight and profit associated with each item, and an upper bound for the capacity of the knapsack. The task is to find a subset of items which maximizes the total of the profits in the subset, yet all selected items fit into the knapsack, i.e., the total weight does not exceed the given capacity. This single-objective problem can be extended directly to the multiobjective case by associating m different profit and m different weight values per item and m capacity bounds. The m-th objective function value of a solution (set of items) is then defined as the sum over their m-th profit values. A solution is feasible, if each of the m summation over their m-th weight values does not exceed the m-th capacity bound.

Back to the list of modules.
top
© 2008 Institut TIK, ETH Zürich | Imprint | Last updated: Tue, 01 Jul 2008 11:37 | Valid XHTML 1.0! Valid CSS! Valid XHTML 1.0