<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://wiki.karljones.com/index.php?action=history&amp;feed=atom&amp;title=Knapsack_problem</id>
		<title>Knapsack problem - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://wiki.karljones.com/index.php?action=history&amp;feed=atom&amp;title=Knapsack_problem"/>
		<link rel="alternate" type="text/html" href="http://wiki.karljones.com/index.php?title=Knapsack_problem&amp;action=history"/>
		<updated>2026-10-23T17:12:34Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.24.2</generator>

	<entry>
		<id>http://wiki.karljones.com/index.php?title=Knapsack_problem&amp;diff=15387&amp;oldid=prev</id>
		<title>Karl Jones: Created page with &quot;The '''knapsack problem''' or '''rucksack problem''' is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number...&quot;</title>
		<link rel="alternate" type="text/html" href="http://wiki.karljones.com/index.php?title=Knapsack_problem&amp;diff=15387&amp;oldid=prev"/>
				<updated>2016-05-14T01:19:52Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot;The &amp;#039;&amp;#039;&amp;#039;knapsack problem&amp;#039;&amp;#039;&amp;#039; or &amp;#039;&amp;#039;&amp;#039;rucksack problem&amp;#039;&amp;#039;&amp;#039; is a problem in &lt;a href=&quot;/index.php/Combinatorial_optimization&quot; title=&quot;Combinatorial optimization&quot;&gt;combinatorial optimization&lt;/a&gt;: Given a set of items, each with a weight and a value, determine the number...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;The '''knapsack problem''' or '''rucksack problem''' is a problem in [[combinatorial optimization]]: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.&lt;br /&gt;
&lt;br /&gt;
== Description ==&lt;br /&gt;
&lt;br /&gt;
It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.&lt;br /&gt;
&lt;br /&gt;
The problem often arises in resource allocation where there are financial constraints and is studied in fields such as [[combinatorics]], [[computer science]], [[complexity theory]], [[cryptography]], [[applied mathematics,]] and daily fantasy sports.&lt;br /&gt;
&lt;br /&gt;
The knapsack problem has been studied for more than a century, with early works dating as far back as 1897.&lt;br /&gt;
&lt;br /&gt;
The name &amp;quot;knapsack problem&amp;quot; dates back to the early works of mathematician [[Tobias Dantzig ]](1884–1956), and refers to the commonplace problem of packing your most valuable or useful items without overloading your luggage.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
&lt;br /&gt;
* [[Change-making problem]]&lt;br /&gt;
* [[Combinatorial auction]]&lt;br /&gt;
* [[Combinatorial optimization]]&lt;br /&gt;
* [[Continuous knapsack problem]]&lt;br /&gt;
* [[Cutting stock problem]]&lt;br /&gt;
* [[List of knapsack problems]]&lt;br /&gt;
* [[Packing problem]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
&lt;br /&gt;
* [https://en.wikipedia.org/wiki/Knapsack_problem Knapsack problem] @ Wikipedia&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Mathematics]]&lt;/div&gt;</summary>
		<author><name>Karl Jones</name></author>	</entry>

	</feed>