Computing the asymptotic worst-case of bin packing lower bounds (Q2643960): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2005.07.032
+Normal rank
@@ Property / OpenAlex ID @@
+W2077707231
@@ Property / OpenAlex ID: W2077707231 / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of lower bound procedures for the bin packing problem
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+New bin packing fast lower bounds
@@ Property / cites work: New bin packing fast lower bounds / rank @@
+Normal rank
@@ Property / cites work @@
+New classes of fast lower bounds for bin packing problems
+Normal rank
@@ Property / cites work @@
+Capacitated Vehicle Routing on Trees
@@ Property / cites work: Capacitated Vehicle Routing on Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds and reduction procedures for the bin packing problem
+Normal rank
@@ Property / cites work @@
+An improved typology of cutting and packing problems
+Normal rank