Keyword: packing

Found 112 papers in total
Packing into the smallest square: Worst-case analysis of lower bounds
Packing into the smallest square: Worst-case analysis of lower bounds
2006,
We address the problem of packing a given set of rectangles into the minimum size...
Using extra dual cuts to accelerate column generation
Using extra dual cuts to accelerate column generation
2005,
Column generation is often used to solve models with stronger linear-programming...
Guided local search for the three-dimensional bin-packing problem
Guided local search for the three-dimensional bin-packing problem
2003,
The three-dimensional bin-packing problem is the problem of orthogonally packing a set...
The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
2006,
The distributor's pallet-packing problem requires the loading of a pallet or container...
A note on an L-approach for solving the manufacturer's pallet loading problem
A note on an L-approach for solving the manufacturer's pallet loading problem
2005,
An L -approach for packing ( l, w )-rectangles into an ( L , W )-rectangle was...
Packing of various radii solid spheres into a parallelepiped
Packing of various radii solid spheres into a parallelepiped
2003,
The paper considers the optimization problem of packing various solid spheres into a...
Φ-functions for complex 2D-objects
Φ-functions for complex 2D-objects
2004,
Within two-dimensional cutting and packing problems with irregular shaped objects, the...
An approximation algorithm for square packing
An approximation algorithm for square packing
2004,
We consider the problem of packing squares into bins which are unit squares, where the...
A short note on a simple search heuristic for the disks packing problem
A short note on a simple search heuristic for the disks packing problem
2004,
This paper presents a short note on a simple heuristic to find a feasible arrangement...
A multi-faced buildup algorithm for three-dimensional packing problems
A multi-faced buildup algorithm for three-dimensional packing problems
2003,
This paper provides a new approach to solving the three-dimensional packing problem....
Approximating disjoint-path problems using packing integer programs
Approximating disjoint-path problems using packing integer programs
2004,
In a packing integer program, we are given a matrix A and column vectors b, c with...
Parametric on-line algorithms for packing rectangles and boxes
Parametric on-line algorithms for packing rectangles and boxes
2003,
We present approximation algorithms for the following problems: the two-dimensional...
The skiving stock problem as a counterpart of the cutting stock problem
The skiving stock problem as a counterpart of the cutting stock problem
2003,
The cutting stock problem (CSP) is a particular case of the set-covering problem....
An L-approach for packing (𝓁, w)-rectangles into rectangular and L-shaped pieces
An L-approach for packing (𝓁, w)-rectangles into rectangular and L-shaped pieces
2003,
This paper presents an approach using a recursive algorithm for packing (𝓁, w...
Approximate algorithms for the container loading problem
Approximate algorithms for the container loading problem
2002,
In this paper we develop several algorithms for solving three-dimensional...
Perfect and ideal 0, +/− 1 matrices
Perfect and ideal 0, +/− 1 matrices
1998,
A 0, +/−1 matrix A is said to be perfect (resp. ideal) if the corresponding...
A near-optimal solution to a two-dimensional cutting stock problem
A near-optimal solution to a two-dimensional cutting stock problem
2000,
We present an asymptotic fully polynomial approximation scheme for strip-packing, or...
A parallel genetic algorithm for solving the container loading problem
A parallel genetic algorithm for solving the container loading problem
2002,
This paper presents a parallel genetic algorithm (PGA) for the container loading...
A distributed global optimization method for packing problems
A distributed global optimization method for packing problems
2003,
Packing optimization problems aim to seek the best way of placing a given set of...
Approximation schemes for ordered vector packing problems
Approximation schemes for ordered vector packing problems
2003,
In this paper we deal with the d -dimensional vector packing problem, which is a...
Two-dimensional packing problems: A survey
Two-dimensional packing problems: A survey
2002,
We consider problems requiring to allocate a set of rectangular items to larger...
A note on an open-end bin packing problem
A note on an open-end bin packing problem
2001,
We consider a variant of the classical one-dimensional bin packing problem, which we...
A new upper bound for unconstrained two-dimensional cutting and packing
A new upper bound for unconstrained two-dimensional cutting and packing
2002,
A new upper bound for the unconstrained two-dimensional cutting or packing problem is...
Bounded space on-line bin packing: Best is better than first
Bounded space on-line bin packing: Best is better than first
2001,
We present a sequence of new linear-time, bounded-space, on-line bin packing...
Papers per page: