A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
This paper presents a rigorous survey and comparisons of the bin packing based VMP methods for the Cloud computing environment. ... Bin packing based algorithms are most used concept to achieve virtual machine placement(VMP). ... The optimized placement of VMs on the PMs can be achieved through efficient resource-aware placement scheme. ...doi:10.11591/ijece.v9i1.pp512-524 fatcat:yhhcrmp4mjhqzhafkevcmgrimy
Cloud computing provides a computing platform for the users to meet their demands in an efficient, cost-effective way. ... We provide two approaches based on linear programming and quadratic programming techniques that significantly improve over the existing theoretical bounds and efficiently solve the problem of virtual machine ... Acknowledgments We would like to thank our colleagues for their help in the implementation of the 'PackingVectors' algorithm. ...arXiv:1011.5064v1 fatcat:2plrnecmfbdnpbrlwvgjsf46lu
We present new approximation schemes for bin packing based on the following two approaches: (1) partitioning the given problem into mostly identical sub-problems of constant size and then construct a solution ... the design of simple and efficient recursive algorithms that solve a problem in terms of smaller sub-problems such that the unused space in bins used by an earlier solved sub-problem is available to subsequently ... This formulation facilitates the design of simple and efficient approximation schemes that recursively solve a problem in terms of smaller but similar sub-problems that exploit the unused space in bins ...arXiv:1902.03422v1 fatcat:paoxr472n5cylhyuuojo2zjxiy
The three-dimensional bin packing problem (3D-BPP) plays an important role in city logistics and manufacturing environments, due to its direct relevance to operational cost. ... Motivated by the compression process of item-loading, we propose a constructive heuristic (i.e., an improved dynamic-volume-based packing algorithm) to solve the studied problem. ... ACKNOWLEDGEMENTS This research was partially supported by the Shenzhen Science and Technology Innovation Commission (JCYJ20210324135011030, WDZC20200818121348001), Guangdong Pearl River Plan (2019QN01X890 ...arXiv:2206.15116v1 fatcat:zulwehv2dndnhmlvm2gekgbrym
The Journal of the Operational Research Society
MurGo_Lo (1987) An efficient approximation scheme for variable-sized bin packing. SIAM J. Computing 16, 149-161. . W. Qu and J. L. ... GALAMBOs (1987) On the expected behavior of the NF algorithm for a dual bin-packing problem. Acta Cybernetica 8, 5-9. . C.H. DaGii and M. Y. ...
2021 IEEE Global Communications Conference (GLOBECOM)
A novel approach based on an extension of bin packing is proposed. We perform a comprehensive evaluation in terms of performance under realworld ISP networks along with synthetic traces. ... Therefore, choosing an efficient mapping of VNFCs to the compute servers is a challenging problem in the optimization of the software-defined, virtualization-based next generation of networks. ... The technique of weights has been used for one-dimensional bin packing problems and produces efficient algorithms  ,  . ...doi:10.1109/globecom46510.2021.9685460 fatcat:xajgobpg4bgczcbrqkrkiycegm
Recently, Galambos and Frenk gave a simple proof of the 1.536--- lower bound for the 1-dimensional bin pack- ing problem. ... Summary: “In this paper we discuss lower bounds for the asymp- totic worst case ratio of on-line algorithms for different kinds of bin packing problems. ...
We show that unlike the one-dimensional case, the two-dimensional packing problem cannot have an asymptotic polynomial time approximation scheme (APTAS), unless P = NP . ... On the positive side, we give an APTAS for the special case of packing d-dimensional cubes into the minimum number of unit cubes. ... The authors thank two anonymous referees for many valuable comments and suggestions regarding the presentation of the paper. ...doi:10.1287/moor.1050.0168 fatcat:dkdj6ktygngttbkmv7fjz76gwy
In this paper we present a fast scalable heuristic for bin packing that partitions the given problem into identical sub-problems of constant size and solves these constant size sub-problems by considering ... We present some empirical evidence to support the scalability of our heuristic and its tighter empirical analysis of hard instances due to improved lower bound on the necessary wastage in an optimal solution ... We refer the reader to BPPLib  for an excellent and comprehensive collection of codes, benchmarks, and links for the one-dimensional Bin Packing and Cutting Stock problem. ...arXiv:1904.12467v1 fatcat:kub7oxrezbeazhjhlywhgxwlc4
In two-dimensional bin packing problems these units are finite rectangles, and the objective is to pack all the items into the minimum number of units, while in two-dimensional strip packing problems there ... is a single standardized unit of given width, and the objective is to pack all the items within the minimum height. ... Acknowledgements We thank the Ministero dell'Istruzione, dell'Universit a a e della Ricerca (MIUR) and the Consiglio Nazionale delle Ricerche (CNR), Italy, for the support to the project. ...doi:10.1016/s0377-2217(02)00123-6 fatcat:6trfgcr2nrgghbdr2cimh6zx4i
We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90 • rotations are allowed. ... Additionally, we show near-optimal packing results for a number of related packing problems. ... Acknowledgements The author thanks Claire Kenyon for introducing him to multidimensional packing problems and, specifically, for asking the question about rotations. ...doi:10.1016/j.orl.2005.02.005 fatcat:zau2egjqtjdkfjw55x4dpsjjs4
The problem considered in this paper is the on-line one- dimensional bin packing problem with the restriction that at most k bins are open at each time. ... Thus, the rule for choosing an open bin to close plays an important role in algorithms for the problem. In this pa- per, the author proposes a new rule for such a purpose. ...
We show how the various variants of the knapsack problem compare for different types of industries. ... Planning is an essential part of any logistics system. The paper tries to generalize the view of a logistics planner by framing it as a knapsack problem. ... Polynomial Time Approximation Schemes (PTAS) Algorithms that solve the knapsack problem either compromise on running time to get an optimal solution or run in pseudo-polynomial time to get an approximate ...doi:10.1145/2377576.2377586 dblp:conf/permis/KolheC10 fatcat:d5gt3d7prjcorkpsqoin22gjzi
Our hardness results apply to the most studied case of 2-dimensional problems with unit square bins, and for 3-dimensional strip packing and covering problems with a strip of unit square base. ... Moreover, for some of these problems we provide explicit lower bounds on asymptotic approximation ratio of any polynomial time approximation algorithm. ... As bin packing and covering problems are known to be NP-hard, the research has concentrated on the design of polynomial time approximation algorithms and schemes for them. ...doi:10.1016/j.jda.2009.02.002 fatcat:7ciuzqu7nzcxbp3ljwk56dn7ky
Many resource allocation problems can be cast as versions of the multi-dimensional vector packing problem. However, in most applications the inputs are inherently dynamic. ... Vector repacking, like vector packing, aims to pack a set of input vectors such that the number of bins used is minimized, but has the additional goal of minimizing the changes from the previous packing ... For multi-dimensional vector packing Woeginger  ruled out an approximation scheme even for the case d = 2. ...doi:10.1109/igcc.2013.6604490 dblp:conf/green/ConsuegraNR13 fatcat:nwj7xksdibev5fduuunzlebrkm
« Previous Showing results 1 — 15 out of 8,139 results