Talk:Knapsack problem
|
Authors of this page, how about four-color problem, job-shop problem? I'm sure there are others, but those are the ones I've heard of. Job shop is the problem of scheduling random jobs of random size for maximum use of shop. Four color is how many colors are required for a map so no country borders on another with same color. Ortolan88
- see Linear programming ... -- Tarquin 20:30 Jan 14, 2003 (UTC)
Seems that bin packing is also related, since it is also about Efficiency.
P.S. I don't see the four-color problem as being related.
--MarkH