Keyword: packing

Found 112 papers in total
A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations
A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations
2014,
This paper proposes an efficient algorithm, with a reduced number of parameters, for...
Packing congruent spheres into a multi-connected polyhedral domain
Packing congruent spheres into a multi-connected polyhedral domain
2013,
In this paper, we have considered a problem of packing the maximal number of congruent...
Packing circles within ellipses
Packing circles within ellipses
2013,
The problem of packing circles within ellipses is considered in the present paper. A...
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
2014,
In this paper, we address the 2‐dimensional vector packing problem where an...
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
2014,
We study the problems of non‐preemptively scheduling and packing malleable and...
Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem
Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem
2013,
An alternative formulation for the set packing problem in a higher dimension is...
Online algorithms for 1‐space bounded multi dimensional bin packing and hypercube packing
Online algorithms for 1‐space bounded multi dimensional bin packing and hypercube packing
2013,
In this paper, we study 1‐space bounded multi‐dimensional bin packing...
A tight analysis of Brown‐Baker‐Katseff sequences for online strip packing
A tight analysis of Brown‐Baker‐Katseff sequences for online strip packing
2013,
We study certain adversary sequences for online strip packing which were first...
A New Local Search Algorithm for Binary Optimization
A New Local Search Algorithm for Binary Optimization
2013,
We develop a new local search algorithm for binary optimization problems, whose...
Iterated tabu search for the circular open dimension problem
Iterated tabu search for the circular open dimension problem
2013,
This paper investigates the circular open dimension problem (CODP), which consists of...
High density packings of equal circles in rectangles with variable aspect ratio
High density packings of equal circles in rectangles with variable aspect ratio
2013,
Arranging a fixed number n of equal non‐overlapping circles in a rectangle with...
Exact algorithms for the two‐dimensional guillotine knapsack
Exact algorithms for the two‐dimensional guillotine knapsack
2012,
The two‐dimensional knapsack problem requires to pack a maximum profit subset...
A parallel multi‐population genetic algorithm for a constrained two‐dimensional orthogonal packing problem
A parallel multi‐population genetic algorithm for a constrained two‐dimensional orthogonal packing problem
2011,
This paper addresses a constrained two‐dimensional (2D), non‐guillotine...
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Tight Approximation Algorithms for Maximum Separable Assignment Problems
2011,
A separable assignment problem ( SAP ) is defined by a set of bins and a set of items...
Scheduling inspired models for two‐dimensional packing problems
Scheduling inspired models for two‐dimensional packing problems
2011,
We propose two exact algorithms for two‐dimensional orthogonal packing problems...
A two‐stage intelligent search algorithm for the two‐dimensional strip packing problem
A two‐stage intelligent search algorithm for the two‐dimensional strip packing problem
2011,
This paper presents a two‐stage intelligent search algorithm for a...
An augmented beam search‐based algorithm for the circular open dimension problem
An augmented beam search‐based algorithm for the circular open dimension problem
2011,
In this paper, we discuss the circular open dimension problem (CODP); that is a...
Approximability of Packing Disjoint Cycles
Approximability of Packing Disjoint Cycles
2011,
Given a graph G , the edge‐disjoint cycle packing problem is to find the...
A fast heuristic for a three‐dimensional non‐convex domain loading problem
A fast heuristic for a three‐dimensional non‐convex domain loading problem
2011,
In this paper we tackle a three‐dimensional non‐convex domain loading...
Adaptive beam search lookahead algorithms for the circular packing problem
Adaptive beam search lookahead algorithms for the circular packing problem
2010,
This paper addresses the circular packing problem (CPP), which consists in packing n...
A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
2010,
The three-dimensional bin packing problem consists of packing a set of boxes into the...
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
2010,
In this paper we consider a variation of the bin packing problem in which bins of...
Tools of mathematical modeling of arbitrary object packing problems
Tools of mathematical modeling of arbitrary object packing problems
2010,
The article reviews the concept of and further develops phi-functions (F-functions) as...
A new destructive bounding scheme for the bin packing problem
A new destructive bounding scheme for the bin packing problem
2010,
In this paper, we present a new lower bounding scheme for the one-dimensional bin...
Papers per page: