Solving the one-dimensional bin packing problem with a weight annealing heuristic (Q2468485): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2006.10.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2006271225
@@ Property / OpenAlex ID: W2006271225 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / 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 @@
+New heuristics for one-dimensional bin-packing
@@ Property / cites work: New heuristics for one-dimensional bin-packing / rank @@
+Normal rank
@@ Property / cites work @@
+New classes of fast lower bounds for bin packing problems
+Normal rank
@@ Property / cites work @@
+The noising method: A new method for combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Guided local search and its application to the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Guided Local Search for the Three-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 @@
+The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
+Normal rank
@@ Property / cites work @@
+Heuristics for the integer one-dimensional cutting stock problem: A computational study
+Normal rank