Bin packing problem: Revision history

Jump to navigation Jump to search
Template:FlatlistExternal tools:

Template:Endflatlist

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

17 June 2025

25 May 2025

  • curprev 23:1423:14, 25 May 2025 imported>Euphoricpoptarts m 54,028 bytes +54,028 It is not correct to state that integer problem is equivalent to the non-integer problem. This is especially important regarding the statement "solvable in polynomial time for any fixed bin capacity", which is only possible for the integer problem. This is because there is a finite set of positive integers which can sum to the fixed bin capacity B, whereas there is an infinite set of positive real numbers which can sum to B.
Retrieved from "http://debianws.lexgopc.com/wiki143/index.php?title=Bin_packing_problem"