Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2002

Highly Cited

2002

A new framework for analyzing online bin packing algorithms is presented. This framework presents a unified way of explaining the… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

The grouping genetic algorithm (GGA) is a genetic algorithm heavily modified to suit the structure of grouping problems. Those… Expand

Is this relevant?

Highly Cited

1990

Highly Cited

1990

Abstract Cutting and packing problems appear under various names in literature, e.g. cutting stock or trim loss problem, bin or… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

Given a set of rectangular pieces, the two-dimensional bin-packing problem is to place the pieces into an open-ended bin of… Expand

Is this relevant?

Highly Cited

1985

Highly Cited

1985

The one-dimensional on-line bin-packing problem is considered, A simple <italic>O</italic>(1)-space and <italic>O</italic… Expand

Is this relevant?

Highly Cited

1982

Highly Cited

1982

We present several polynomial-time approximation algorithms for the one-dimensional bin-packing problem. using a subroutine to… Expand

Is this relevant?

Highly Cited

1981

Highly Cited

1981

For any listL ofn numbers in (0, 1) letL* denote the minimum number of unit capacity bins needed to pack the elements ofL. We… Expand

Is this relevant?

Highly Cited

1978

Highly Cited

1978

We consider one of the basic, well-studied problems of scheduling theory, that of nonpreemptively scheduling n independent tasks… Expand

Is this relevant?

Highly Cited

1974

Highly Cited

1974

Low-order polynomial time algorithms for near-optimal solutions to the problem of bin packing are studied. The previously… Expand

Is this relevant?