Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438): Difference between revisions

@@ Property / cites work @@
+The two-dimensional bin packing problem with variable bin sizes and costs
+Normal rank
@@ Property / cites work @@
+Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
+Normal rank
@@ Property / cites work @@
+An improved typology of cutting and packing problems
+Normal rank
@@ Property / cites work @@
+Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
+Normal rank
@@ Property / cites work @@
+An exact algorithm for general, orthogonal, two-dimensional knapsack problems
+Normal rank
@@ Property / cites work @@
+New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
+Normal rank
@@ Property / cites work @@
+An Exact Algorithm for Higher-Dimensional Orthogonal Packing
+Normal rank
@@ Property / cites work @@
+A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
+Normal rank
@@ Property / cites work @@
+On the two-dimensional knapsack problem
@@ Property / cites work: On the two-dimensional knapsack problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Exact Approach to the Strip-Packing Problem
@@ Property / cites work: An Exact Approach to the Strip-Packing Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
+Normal rank
@@ Property / cites work @@
+On genetic algorithms for the packing of polygons
@@ Property / cites work: On genetic algorithms for the packing of polygons / rank @@
+Normal rank
@@ Property / cites work @@
+A population heuristic for constrained two-dimensional non-guillotine cutting
+Normal rank
@@ Property / cites work @@
+A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
+Normal rank
@@ Property / cites work @@
+Denser Packings Obtained in <i>O</i>(<i>n</i> log log <i>n</i>) Time
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3882189
@@ Property / cites work: Q3882189 / rank @@
+Normal rank
@@ Property / cites work @@
+A general framework for bounds for higher-dimensional orthogonal packing problems.
+Normal rank
@@ Property / cites work @@
+An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
+Normal rank
@@ Property / cites work @@
+An Algorithm for Two-Dimensional Cutting Problems
@@ Property / cites work: An Algorithm for Two-Dimensional Cutting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
+Normal rank
@@ Property / cites work @@
+A Minimal Algorithm for the 0-1 Knapsack Problem
@@ Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A parallel hybrid local search algorithm for the container loading problem
+Normal rank
@@ Property / cites work @@
+Heuristics for the container loading problem
@@ Property / cites work: Heuristics for the container loading problem / rank @@
+Normal rank