Optimization and Packing Problems
Optimization and Packing Problems is a research topic within Industrial and Manufacturing Engineering. Science Explorer counts 16k research works in it since 1956. 10.0% of them reached the world's top 10% most cited for their field and year.
This cluster of papers focuses on the optimization of cutting and packing problems, including knapsack problems, bin packing, heuristic and metaheuristic algorithms, three-dimensional packing, rectangular packing, genetic algorithms, and strip packing. The research explores various approaches to efficiently utilize space and resources for packing objects into containers or arranging them for optimal use.
- Cutting
- Packing
- Knapsack Problem
- Bin Packing
- Heuristic Algorithms
- Metaheuristic Algorithms
- Three-Dimensional Packing
- Rectangular Packing
- Genetic Algorithm
- Strip Packing
- Research works
- 16k fractional, since 1956
- In the world top 10%
- 1.7k per year above
- Top-10% rate
- 10.0% share of its works in the world top 10%
- Growth, 2018-21 → 2022-25
- +7% the tick is no change
- Largest producer
China
41% of the 10 largest, 2022-now
Discussion
Ask a question or share a note about Optimization and Packing Problems. Posts are plain text and can be reported.