Keyword

bin packing

Description: Bin packing is an optimization problem that assigns items to capacity-limited containers while minimizing the number of containers used.

Primary topic: Optimization and Packing Problems (62%)

Wikidata ID: wiki/Q814581

OpenAlex ID: keywords/bin-packing-problem

Knapsack Problems: Algorithms and Computer Implementations

1991 · David Connolly, Silvano Martello, et al. · Journal of the Operational Research Society · 3,120

An improved typology of cutting and packing problems

2006 · Gerhard Wäscher, Heike Haußner, et al. · European Journal of Operational Research · 1,558

A Dynamic Programming Approach to Sequencing Problems

1962 · Michael Held, Richard M. Karp · Journal of the Society for Industrial and Applied Mathematics · 1,336

A typology of cutting and packing problems

1990 · Harald Dyckhoff · European Journal of Operational Research · 1,110

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

1974 · D. S. Johnson, A. Demers, et al. · SIAM Journal on Computing · 913

Approximation algorithms for bin packing: a survey

1996 · E. G. Coffman, M. R. Garey, et al. · PWS Publishing Co. eBooks · 867

Two-dimensional packing problems: A survey

2002 · Andrea Lodi, Silvano Martello, et al. · European Journal of Operational Research · 847

Energy aware consolidation for cloud computing

2008 · Shekhar Srikantaiah, Aman Kansal, et al. · 781

Orthogonal Packings in Two Dimensions

1980 · Brenda S. Baker, E. G. Coffman, Jr., et al. · SIAM Journal on Computing · 700

An Application of Bin-Packing to Multiprocessor Scheduling

1978 · E. G. Coffman, Jr., M. R. Garey, et al. · SIAM Journal on Computing · 660

A hybrid grouping genetic algorithm for bin packing

1996 · Emanuel Falkenauer · Journal of Heuristics · 601

Near-optimal bin packing algorithms

1973 · David S. Johnson · DSpace@MIT (Massachusetts Institute of Technology) · 570

Fast algorithms for bin packing

1974 · David S. Johnson · Journal of Computer and System Sciences · 540

PDF

Bin packing can be solved within 1 + ε in linear time

1981 · W. Fernandez de la Vega, G. S. Lueker · COMBINATORICA · 498

Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

1980 · E. G. Coffman, Jr., M. R. Garey, et al. · SIAM Journal on Computing · 481

The complexity of optimization problems

1988 · Mark W. Krentel · Journal of Computer and System Sciences · 441

PDF

Approximation Algorithms for Bin-Packing — An Updated Survey

1984 · E. G. Coffman, M. R. Garey, et al. · Courses and lectures · 433

Issues in the development of approaches to container loading

1995 · E.E. Bischoff, M.S.W. Ratcliff · Omega · 407

On the capacitated vehicle routing problem

2003 · T.K. Ralphs, L. Kopman, et al. · Mathematical Programming · 405

Bin packing and cutting stock problems: Mathematical models and exact algorithms

2016 · Maxence Delorme, Manuel Iori, et al. · European Journal of Operational Research · 379

Set Partitioning via Inclusion-Exclusion

2009 · Andreas Björklund, Thore Husfeldt, et al. · SIAM Journal on Computing · 370

Resource constrained scheduling as generalized bin packing

1976 · M.R Garey, R.L Graham, et al. · Journal of Combinatorial Theory Series A · 347

Packing problems

1992 · Kathryn A. Dowsland, William B. Dowsland · European Journal of Operational Research · 346

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

2005 · Chandra Chekuri, Sanjeev Khanna · SIAM Journal on Computing · 332

An Evaluation of SMT-Based Schedule Synthesis for Time-Triggered Multi-hop Networks

2010 · Wilfried Steiner · Proceedings/Proceedings - Real-Time Systems Symposium · 318

Works count: 5,003

Citation count: 72,410