Prospective Network Flow Models and Algorithms for Bin Packing Problems (Q2883549): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2010.05.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2090507854
@@ Property / OpenAlex ID: W2090507854 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
+Normal rank
@@ Property / cites work @@
+Bidimensional Packing by Bilinear Programming
@@ Property / cites work: Bidimensional Packing by Bilinear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A new constraint programming approach for the orthogonal packing problem
+Normal rank
@@ Property / cites work @@
+Q3347319
@@ Property / cites work: Q3347319 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for the non-oriented two-dimensional bin packing problem
+Normal rank
@@ Property / cites work @@
+New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
+Normal rank
@@ Property / cites work @@
+Recent advances on two-dimensional bin packing problems
+Normal rank