Results 1  10
of
319,293
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
"... This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We present new faster and much simpler algorithms for these problems. ..."
Abstract

Cited by 325 (5 self)
 Add to MetaCart
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We present new faster and much simpler algorithms for these problems.
On Multidimensional Packing Problems
 TENTH ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS
, 1999
"... We study the approximability of multidimensional generalizations of the classical problems of multiprocessor scheduling, bin packing and the knapsack problem. Specifically, we study the vector scheduling problem, its dual problem, namely, the vector bin packing problem, and a class of packing integ ..."
Abstract

Cited by 96 (4 self)
 Add to MetaCart
We study the approximability of multidimensional generalizations of the classical problems of multiprocessor scheduling, bin packing and the knapsack problem. Specifically, we study the vector scheduling problem, its dual problem, namely, the vector bin packing problem, and a class of packing
Packing problems with orthogonal rotations
 In Proc. of Latin American Theoretical INformatics
, 2004
"... Abstract. In this extended abstract, we present approximation algorithms forthe following packing problems: the strip packing problem, the twodimensional bin packing problem, the threedimensional strip packing problem, and the threedimensional bin packing problem. For all these problems, we consi ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Abstract. In this extended abstract, we present approximation algorithms forthe following packing problems: the strip packing problem, the twodimensional bin packing problem, the threedimensional strip packing problem, and the threedimensional bin packing problem. For all these problems, we
Modelling of Packing Problems
 Optimization
, 1993
"... this paper packing problems of the following type are investigated: Let be given a closed and bounded region B with B ae R ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
this paper packing problems of the following type are investigated: Let be given a closed and bounded region B with B ae R
On the Online Bin Packing Problem
 Journal of the ACM
, 2001
"... A new framework for analyzing online bin packing algorithms is presented. This framework presents a unified way of explaining the performance of algorithms based on the Harmonic approach [3, 5, 8, 10, 11, 12]. Within this framework, it is shown that a new algorithm, Harmonic++, has asymptotic perfor ..."
The Mixed Vertex Packing Problem
 Mathematical Programming
, 2000
"... We study a generalization of the vertex packing problem having both binary and bounded continuous variables, called the mixed vertex packing problem (MVPP). The wellknown vertex packing model arises as a subproblem or relaxation of many 01 integer problems, whereas the mixed vertex packing model a ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We study a generalization of the vertex packing problem having both binary and bounded continuous variables, called the mixed vertex packing problem (MVPP). The wellknown vertex packing model arises as a subproblem or relaxation of many 01 integer problems, whereas the mixed vertex packing model
The tile packing problem
, 2006
"... The tile packing problem is a challenging combinatorial puzzle based on tiles with colored edges or colored corners. In its different incarnations, the puzzle gives rise to a number of interesting problems. In this paper, we sketch the background of the tile packing problem and present solutions to ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The tile packing problem is a challenging combinatorial puzzle based on tiles with colored edges or colored corners. In its different incarnations, the puzzle gives rise to a number of interesting problems. In this paper, we sketch the background of the tile packing problem and present solutions
PACKING PROBLEMS ON A PC
, 1991
"... Bin packing is a problem with many applications in various industries. This thesis addresses a specific instance of the this problem, known as the Container Packing problem. Special attention is paid to the Pallet Loading problem which is a restricted subproblem of the general Container Packing pro ..."
Abstract
 Add to MetaCart
Bin packing is a problem with many applications in various industries. This thesis addresses a specific instance of the this problem, known as the Container Packing problem. Special attention is paid to the Pallet Loading problem which is a restricted subproblem of the general Container Packing
The Lazy Bin Packing Problem
, 2004
"... Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number of accepted items or accepted volume. This paper presents results for the opposite problems, where we want to maximize the number of bins used or minimize ..."
Abstract
 Add to MetaCart
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number of accepted items or accepted volume. This paper presents results for the opposite problems, where we want to maximize the number of bins used
Results 1  10
of
319,293