Approximation and online algorithms for multidimensional bin packing: A survey
The bin packing problem is a well-studied problem in combinatorial optimization. In the
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …
[كتاب][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
Online algorithms: a survey
During the last 15 years online algorithms have received considerable research interest. In
this survey we give an introduction to the competitive analysis of online algorithms and …
this survey we give an introduction to the competitive analysis of online algorithms and …
On-line algorithms
Over the past twelve years, online algorithms have received considerable research interest.
Online problems had been investigated already in the seventies and early eighties but an …
Online problems had been investigated already in the seventies and early eighties but an …
Measuring the problem-relevant information in input
We propose a new way of characterizing the complexity of online problems. Instead of
measuring the degradation of the output quality caused by the ignorance of the future we …
measuring the degradation of the output quality caused by the ignorance of the future we …
The relative worst order ratio for online algorithms
We define a new measure for the quality of online algorithms, the relative worst order ratio,
using ideas from the max/max ratio [Ben-David and Borodin 1994] and from the random …
using ideas from the max/max ratio [Ben-David and Borodin 1994] and from the random …
The relative worst-order ratio applied to paging
The relative worst-order ratio, a relatively new measure for the quality of on-line algorithms,
is extended and applied to the paging problem. We obtain results significantly different from …
is extended and applied to the paging problem. We obtain results significantly different from …
[PDF][PDF] Multidimensional bin packing and other related problems: A survey
HI Christensen, A Khan, S Pokutta, P Tetali - 2016 - tetali.math.gatech.edu
The bin packing problem is a well-studied problem in combinatorial optimization. In the
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …
An online dynamic dual bin packing with lookahead approach for server-to-cell assignment in computer server industry
Efficient production scheduling in computer server industry remains a critical challenge. This
challenge becomes particularly acute during the testing phase, where servers are assigned …
challenge becomes particularly acute during the testing phase, where servers are assigned …
The accommodating function: A generalization of the competitive ratio
A new measure, the accommodating function, for the quality of on-line algorithms is
presented. The accommodating function, which is a generalization of both the competitive …
presented. The accommodating function, which is a generalization of both the competitive …