knapsckprblm.html
来自「数据结构词典(英文)」· HTML 代码 · 共 50 行
HTML
50 行
<!DOCTYPE HTML PUBLIC "-//IETF//DTD W3 HTML 2.0//EN">
<HTML lang="en-US">
<HEAD>
<TITLE>knapsack problem</TITLE>
<META name="description"
content="Definition of knapsack problem,
possibly with links to more information and implementations.">
<META name="keywords" content="knapsack problem">
</HEAD>
<BODY BGCOLOR="#FFFFFF">
<H1>knapsack problem</H1>
<P>
(classic problem)
<P>
<strong>Definition:</strong>
Given items of different values and volumes, find the most valuable set of items which fit in a knapsack of fixed volume.
<P><strong>See also</strong>
<a href="fractnlknpsk.html" tppabs="http://hissa.nist.gov/dads/HTML/fractnlknpsk.html"><em>fractional knapsack problem</em></a>, <a href="binpacking.html" tppabs="http://hissa.nist.gov/dads/HTML/binpacking.html"><em>bin packing</em></a>.
<P><em>Note:
Also called 0-1 knapsack, as opposed to the <a href="fractnlknpsk.html" tppabs="http://hissa.nist.gov/dads/HTML/fractnlknpsk.html"><em>fractional knapsack problem</em></a>. The <a href="decisionpblm.html" tppabs="http://hissa.nist.gov/dads/HTML/decisionpblm.html"><em>decision problem</em></a> form is, given items of different values and volumes and a knapsack, is there a subset which exceeds a certain value? The decision problem is <a href="npcomplete.html" tppabs="http://hissa.nist.gov/dads/HTML/npcomplete.html"><em>NP-complete</em></a>.</em>
<P>Author: <a href="terms.html#authorPEB" tppabs="http://hissa.nist.gov/dads/terms.html#authorPEB">PEB</a>
<H2>Implementation</H2>
<A HREF="javascript:if(confirm('http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://www.cs.sunysb.edu/%7Ealgorith/files/knapsack.shtml \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address. \n\nDo you want to open it from the server?'))window.location='http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://www.cs.sunysb.edu/%7Ealgorith/files/knapsack.shtml'" tppabs="http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://www.cs.sunysb.edu/%7Ealgorith/files/knapsack.shtml">(Fortran and Pascal)</A>
<hr>
Go to the
<A HREF="terms.html" tppabs="http://hissa.nist.gov/dads/terms.html">Algorithms, Data Structures, and Problems</A>
home page.
<hr>
If you have suggestions, corrections, or comments, please get in touch
with
<a href="javascript:if(confirm('http://hissa.nist.gov/~black/black.html \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address. \n\nDo you want to open it from the server?'))window.location='http://hissa.nist.gov/~black/black.html'" tppabs="http://hissa.nist.gov/~black/black.html">Paul E. Black</a>
(<a href="mailto:paul.black@nist.gov">paul.black@nist.gov</a>).
<p>
Entry modified Thu Oct 7 12:28:46 1999.<BR>
HTML page formatted Wed Dec 22 09:35:39 1999.
<P>
This page's URL is
<A href="knapsckprblm.html" tppabs="http://hissa.nist.gov/dads/HTML/knapsckprblm.html">http://hissa.nist.gov/dads/HTML/knapsckprblm.html</A>
</BODY>
</HTML>
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?