Two-dimensional knapsack-block packing problem
From MaRDI portal
Publication:1984921
DOI10.1016/j.apm.2019.03.039zbMath1481.90226OpenAlexW2928681278MaRDI QIDQ1984921
Kaike Zhang, Shengchao Zhou, Ni Du, Xue-Ping Li
Publication date: 7 April 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2019.03.039
Related Items
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Solving a Mathematical Model for Small Vegetable Sellers in India by a Stochastic Knapsack Problem: An Advanced Genetic Algorithm Based Approach
Uses Software
Cites Work
- The three-dimensional knapsack problem with balancing constraints
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- The multidimensional 0-1 knapsack problem: an overview.
- On the two-dimensional knapsack problem
- Approximation algorithms for knapsack problems with cardinality constraints
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- Heuristics for the container loading problem
- Models and bounds for two-dimensional level packing problems
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- Three-stage heuristic algorithm for three-dimensional irregular packing problem
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- An improved typology of cutting and packing problems
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An Algorithm for Two-Dimensional Cutting Problems
- Handbook of Combinatorial Optimization
- Multistage Cutting Stock Problems of Two and More Dimensions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
This page was built for publication: Two-dimensional knapsack-block packing problem
