New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem (Q3114308): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207540802426656
+Normal rank
@@ Property / OpenAlex ID @@
+W2163871914
@@ Property / OpenAlex ID: W2163871914 / rank @@
+Normal rank
@@ Property / cites work @@
+Ond-threshold graphs andd-dimensional bin packing
@@ Property / cites work: Ond-threshold graphs andd-dimensional bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+A new LP-based lower bound for the cumulative scheduling problem
+Normal rank
@@ Property / cites work @@
+Computing redundant resources for the resource constrained project scheduling problem
+Normal rank
@@ Property / cites work @@
+New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
+Normal rank
@@ Property / cites work @@
+A tight lower bound for optimal bin packing
@@ Property / cites work: A tight lower bound for optimal bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+A new exact method for the two-dimensional bin-packing problem with fixed orientation
+Normal rank
@@ Property / cites work @@
+A general framework for bounds for higher-dimensional orthogonal packing problems.
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast lifting procedures for the bin packing problem
+Normal rank
@@ Property / cites work @@
+Exact Solution of the Two-Dimensional Finite Bin Packing Problem
+Normal rank