Editing Talk:1952: Backpack Decisions

Jump to: navigation, search
Ambox notice.png Please sign your posts with ~~~~

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 6: Line 6:
 
The knapsack optimization problem is famous for being NP-hard ([[wikipedia:Knapsack problem|Knapsack problem]]). Seems to be an allusion to it. Sebastian --[[Special:Contributions/162.158.91.191|162.158.91.191]] 15:53, 7 February 2018 (UTC)
 
The knapsack optimization problem is famous for being NP-hard ([[wikipedia:Knapsack problem|Knapsack problem]]). Seems to be an allusion to it. Sebastian --[[Special:Contributions/162.158.91.191|162.158.91.191]] 15:53, 7 February 2018 (UTC)
 
: Nope, see below. The knapsack problem is about optimizing the amount of stuff put into something, while Cueball goes through a [[wikipedia:buying decision process|buying decision process]]. [[Special:Contributions/162.158.114.100|162.158.114.100]] 17:49, 7 February 2018 (UTC)
 
: Nope, see below. The knapsack problem is about optimizing the amount of stuff put into something, while Cueball goes through a [[wikipedia:buying decision process|buying decision process]]. [[Special:Contributions/162.158.114.100|162.158.114.100]] 17:49, 7 February 2018 (UTC)
βˆ’
:: But the buying decision process could be solved by a variation of the knapsack optimation problem: You can choose several features, but cannot combine all of them. The difficulty would be linear in the number of available backpacks (but this would/could be a very large number - for all the other listed items like car, phone, college, appartment, laptop there is less choice available and the decision can be made way faster) and nonlinear in the number of criteria. Sebastian --[[Special:Contributions/162.158.91.191|162.158.91.191]] 10:18, 8 February 2018 (UTC)
+
:: But the buying decision process could be solved by a variation of the knapsack optimation problem: You can choose several features, but cannot combine all of them. The difficulty would be linear in the number of available backpacks (but this would/could be a very large number) and nonlinear in the number of criteria. Sebastian --[[Special:Contributions/162.158.91.191|162.158.91.191]] 10:18, 8 February 2018 (UTC)
  
 
This comic is an illustration of the [[wikipedia:law of triviality|law of triviality]] aka the bike-shed effect. [[Special:Contributions/162.158.114.100|162.158.114.100]] 17:42, 7 February 2018 (UTC)
 
This comic is an illustration of the [[wikipedia:law of triviality|law of triviality]] aka the bike-shed effect. [[Special:Contributions/162.158.114.100|162.158.114.100]] 17:42, 7 February 2018 (UTC)

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)

Template used on this page: