Skip to content
On this page:OverviewPublicationsResearchersKey papersJournalsOpen accessInstitutions
PICO Portalanswers from OpenAlex

Optimization and Packing Problems

TopicLeading institutions, researchers & key papers

Optimization and Packing Problems is a topic indexed in PICO Portal from OpenAlex.

What is known about Optimization and Packing Problems?

PICO Portalrecord 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?

PICO Portalindexed works

Optimization and Packing Problems has 20 works in the PICO Portal 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?

PICO Portalopenalex

The OpenAlex for Optimization and Packing Problems is on the source record.

What are the most-cited papers on Optimization and Packing Problems?

PICO Portalmost 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
European Journal of Operational Research. 2017233 Citations
Variable Sized Bin Packing
Donald K. Friesen, Michael A. Langston
SIAM Journal on Computing. 1986223 Citations
A simple randomized algorithm for two-dimensional strip packing
Shuangyuan Yang, Shui-Hua HAN, Weiguo Ye
Computers & Operations Research. 201242 Citations
Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems
Abraham P. Punnen, Pooja Pandey, Michael Friesen
Computers & Operations Research. 201920 Citations

Where is Optimization and Packing Problems research published, and who funds it?

PICO Portalvenues & funding sources

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?

PICO Portalopen access share
0%OPEN ACCESS
Gold
0%
Green
0%
Hybrid
0%
Bronze
0%
Closed
100%

Related on PICO Portal

470M+ articles · 14-day free trial