The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP (Q3842995): Difference between revisions

@@ Property / DOI @@
-.1111/j.1475-3995.1997.tb00093.x
@@ Property / DOI: 10.1111/j.1475-3995.1997.tb00093.x / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1111/j.1475-3995.1997.tb00093.x
+Normal rank
@@ Property / OpenAlex ID @@
+W2155312717
@@ Property / OpenAlex ID: W2155312717 / rank @@
+Normal rank
@@ Property / cites work @@
+A typology of cutting and packing problems
@@ Property / cites work: A typology of cutting and packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
+Normal rank
@@ Property / cites work @@
+An instance of the cutting stock problem for which the rounding property does not hold
+Normal rank
@@ Property / cites work @@
+Solving binary cutting stock problems by column generation and branch- and-bound
+Normal rank
@@ Property / cites work @@
+Heuristics for the integer one-dimensional cutting stock problem: A computational study
+Normal rank
@@ Property / DOI @@
+.1111/J.1475-3995.1997.TB00093.X
@@ Property / DOI: 10.1111/J.1475-3995.1997.TB00093.X / rank @@
+Normal rank