Keyword

packing problems

Description: Packing problems are mathematical optimization problems involving the placement of objects into containers or regions to maximize density or minimize container use.

Primary topic: Optimization and Packing Problems (40%)

Wikidata ID: wiki/Q3851477

OpenAlex ID: keywords/packing-problems

Reducibility among Combinatorial Problems

1972 · Richard M. Karp · Springer eBooks · 11,503

P ACKMOL : A package for building initial configurations for molecular dynamics simulations

2009 · L. Martínez, R. Andrade, et al. · Journal of Computational Chemistry · 9,825

Efficient algorithms for agglomerative hierarchical clustering methods

1984 · William H. E. Day, Herbert Edelsbrunner · Journal of Classification · 972

Probabilistic construction of deterministic algorithms: Approximating packing integer programs

1988 · Prabhakar Raghavan · Journal of Computer and System Sciences · 544

PDF

On genetic algorithms for the packing of polygons

1996 · Stefan Jakobs · European Journal of Operational Research · 483

Determining the minimum-area encasing rectangle for an arbitrary closed curve

1975 · H. Freeman, R. Shapira · Communications of the ACM · 418

PDF

On a Packing and Covering Problem

1985 · Vojtěch Rödl · European Journal of Combinatorics · 401

PDF

Packing problems

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

Recent advances on two-dimensional bin packing problems

2002 · Andrea Lodi, Silvano Martello, et al. · Discrete Applied Mathematics · 325

PDF

A heuristic for packing boxes into a container

1980 · J.A. George, D.F. Robinson · Computers & Operations Research · 313

Algorithms for Vertex Partitioning Problems on Partial k-Trees

1997 · Jan Arne Telle, Andrzej Proskurowski · SIAM Journal on Discrete Mathematics · 308

Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems

1996 · Dorit S. Hochbaum · PWS Publishing Co. eBooks · 221

A packing problem with applications to lettering of maps

1991 · Michael Formann, Frank Wagner · Annual Symposium on Computational Geometry (SoCG) · 220

Truthful and Near-Optimal Mechanism Design via Linear Programming

2005 · R. Lavi, C. Swamy · Annual Symposium on Foundations of Computer Science · 218

The Packing Problem in Statistics, Coding Theory and Finite Projective Spaces: Update 2001

2001 · J. W. P. Hirschfeld, L. Storme · Developments in mathematics · 208

A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies

2009 · Mhand Hifi, Rym M'Hallah · Advances in Operations Research · 206

PDF

The Price of Being Near-sighted

2006 · Fabian Kuhn, Thomas Moscibroda, et al. · 193

Random Sampling in Cut, Flow, and Network Design Problems

1999 · David R. Karger · Mathematics of Operations Research · 189

Randomized Rounding without Solving the Linear Program

1995 · Neal E. Young · 177

Some experiments with simulated annealing techniques for packing problems

1993 · Kathryn A. Dowsland · European Journal of Operational Research · 158

Constructing Packings in Grassmannian Manifolds via Alternating Projection

2008 · I. S. Dhillon, Jr. R. W. Heath, et al. · Experimental Mathematics · 156

PDF

Covering and Packing in Graphs, I.

1970 · Frank Harary · Annals of the New York Academy of Sciences · 150

Semantic Attachments for Domain-Independent Planning Systems

2012 · Christian Dornhege, Patrick Eyerich, et al. · Springer tracts in advanced robotics · 134

Two-dimensional Packing utilising Evolutionary Algorithms and other Meta-Heuristic Methods

2002 · E. Mitchell Hopper · OpenGrey (Institut de l'Information Scientifique et Technique) · 124

Truthful and Near-Optimal Mechanism Design via Linear Programming

2011 · Ron Lavi, Chaitanya Swamy · Journal of the ACM · 119

Works count: 1,144

Citation count: 35,000