Heuristics for determining the number of warehouses for storing non-compatible products (Q3410327): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1111/j.1475-3995.2005.00523.x
+Normal rank
@@ Property / OpenAlex ID @@
+W2001973270
@@ Property / OpenAlex ID: W2001973270 / rank @@
+Normal rank
@@ Property / cites work @@
+A variable neighborhood search for graph coloring.
+Normal rank
@@ Property / cites work @@
+Exact solution of bin-packing problems using column generation and branch-and-bound
+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 @@
+Heuristics and lower bounds for the bin packing problem with conflicts
+Normal rank
@@ Property / cites work @@
+Ant colony optimization and local search for bin packing and cutting stock problems
+Normal rank
@@ Property / cites work @@
+Local search algorithms for the bin packing problem and their relationships to various construction heuristics
+Normal rank