ScholarIQanswers from OpenAlex
Optimization and Packing Problems
TopicLeading institutions, researchers & key papers
Optimization and Packing Problems is a topic indexed in ScholarIQ from OpenAlex.
What is known about Optimization and Packing Problems?
ScholarIQrecord summary
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?
ScholarIQindexed works
Optimization and Packing Problems has 20 works in the ScholarIQ index. The count is the OpenAlex total, not the number of papers listed on this page.
What is the OpenAlex record for Optimization and Packing Problems?
ScholarIQopenalex
The OpenAlex for Optimization and Packing Problems is on the source record.
What are the most-cited papers on Optimization and Packing Problems?
ScholarIQmost cited works
A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
Lijun Wei, Zhenzhen Zhang, Defu Zhang, Stephen C.H. Leung
Variable Sized Bin Packing
Donald K. Friesen, Michael A. Langston
A simple randomized algorithm for two-dimensional strip packing
Shuangyuan Yang, Shui-Hua HAN, Weiguo Ye
Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems
Abraham P. Punnen, Pooja Pandey, Michael Friesen
Where is Optimization and Packing Problems research published, and who funds it?
ScholarIQvenues & funding sources
TOP JOURNALS
TOP FUNDERS
National Science Foundation—
NIH—
Wellcome Trust—
European Research Council—
Funder breakdown is a member featureSign up free to unlock
How much of the research on Optimization and Packing Problems is open access?
ScholarIQopen access share
0%OPEN ACCESS