Journal ArticleDOI
Approximation and online algorithms for multidimensional bin packing: A survey
Reads0
Chats0
TLDR
This survey considers approximation and online algorithms for several classical generalizations of bin packing problem such as geometric bin packing, vector bin packing and various other related problems.About:
This article is published in Computer Science Review.The article was published on 2017-05-01. It has received 202 citations till now. The article focuses on the topics: Bin packing problem & Set packing.read more
Citations
More filters
Computers And Intractability A Guide To The Theory Of Np Completeness
TL;DR: In this paper, a guide to the theory of np completeness is given for downloading computers and intractability a guide for reading good books with a cup of tea in the afternoon, instead they juggled with some harmful bugs inside their desktop computer.
Journal ArticleDOI
Communication-Aware Container Placement and Reassignment in Large-Scale Internet Data Centers
Liang Lv,Yuchao Zhang,Yusen Li,Ke Xu,Dan Wang,Wendong Wang,Minghui Li,Xuan Cao,Qingqing Liang +8 more
TL;DR: This paper proposes an efficient communication aware worst fit decreasing algorithm to place a set of new containers into data centers and proposes a two-stage algorithm called Sweep&Search to optimize a given initial distribution of containers by migrating containers among servers.
Journal ArticleDOI
Exact solution techniques for two-dimensional cutting and packing
TL;DR: This work surveys the main formulations and solution methods for two-dimensional orthogonal cutting and packing problems, where both items and bins are rectangles, and focuses on exact methods and relaxations for the four main problems from the literature.
Journal ArticleDOI
Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
TL;DR: In this paper , the authors present a survey of the developments in this field after Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger (2004).
Journal ArticleDOI
Cloud-SEnergy: A Bin-Packing Based Multi-Cloud Service Broker for Energy Efficient Composition and Execution of Data-intensive Applications
TL;DR: The results gained from the experiments demonstrate a superior performance of Cloud-SEnergy which ranged from an average energy consumption reduction of 4.3% when compared to Based Cloud technique, to an average reduction of 43.2% whenCompared to All Clouds technique.
References
More filters
Book
Approximation Algorithms
TL;DR: Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field.
Book
Geometric Algorithms and Combinatorial Optimization
TL;DR: In this article, the Fulkerson Prize was won by the Mathematical Programming Society and the American Mathematical Society for proving polynomial time solvability of problems in convexity theory, geometry, and combinatorial optimization.
Book
Online Computation and Competitive Analysis
Allan Borodin,Ran El-Yaniv +1 more
TL;DR: This book discusses competitive analysis and decision making under uncertainty in the context of the k-server problem, which involves randomized algorithms in order to solve the problem of paging.
Book
Approximation Algorithms for NP-Hard Problems
TL;DR: This book reviews the design techniques for approximation algorithms and the developments in this area since its inception about three decades ago and the "closeness" to optimum that is achievable in polynomial time.
Journal ArticleDOI
Approximation algorithms for combinatorial problems
TL;DR: For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as n^@e, where n is the problem size and @e>0 depends on the algorithm.