Sciweavers

1328 search results - page 4 / 266
» An Optimization Algorithm for the Ordered Open-End Bin-Packi...
Sort
View
IPCO
2004
144views Optimization» more  IPCO 2004»
13 years 7 months ago
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
R. Ravi, Amitabh Sinha
JCO
2006
83views more  JCO 2006»
13 years 5 months ago
Separating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
13 years 7 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
SIU
2002
97views more  SIU 2002»
13 years 5 months ago
Problem Generators for Rectangular packing problems
Abstract. In order to verify and test the performance of new packing algorithms relative to existing algorithms, test problems are needed. The scope of published test instances for...
E. Hopper, B. C. H. Turton
PPSN
1998
Springer
13 years 10 months ago
Genetic Algorithms for the Multiple Container Packing Problem
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
Günther R. Raidl, Gabriele Kodydek