Optimization and Packing Problems
Optimization and Packing Problems is a topic indexed in ScholarIQ from OpenAlex.
What is known about Optimization and Packing Problems?
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.
How many works does Optimization and Packing Problems have?
Optimization and Packing Problems has 24,861 works in the ScholarIQ index. The count is the OpenAlex total, not the number of papers listed on this page.
How many citations does Optimization and Packing Problems have?
Optimization and Packing Problems has 325,459 citations in the OpenAlex counts ScholarIQ stores.
What is the OpenAlex record for Optimization and Packing Problems?
The OpenAlex for Optimization and Packing Problems is on the source record.