New heuristics for one-dimensional bin-packing (Q5959374): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
+Normal rank
@@ Property / cites work @@
+Exact solution of bin-packing problems using column generation and branch-and-bound
+Normal rank
@@ Property / cites work @@
+Q3840364
@@ Property / cites work: Q3840364 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic algorithms for the multiple knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4495203
@@ Property / cites work: Q4495203 / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0305-0548(00)00082-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2017450662
@@ Property / OpenAlex ID: W2017450662 / rank @@
+Normal rank