About the Structure of the Integer Cone and its Application to Bin Packing
نویسندگان
چکیده
We consider the bin packing problem with d different item sizes and revisit the structure theorem given by Goemans and Rothvoß [GR14] about solutions of the integer cone. We present new techniques on how solutions can be modified and give a new structure theorem that relies on the set of vertices of the underlying integer polytope. As a result of our new structure theorem, we obtain an algorithm for the bin packing problem with running time |V | 2 O(d) · enc(I) O(1) , where V is the set of vertices of the integer knapsack polytope and enc(I) is the encoding length of the bin packing instance. The algorithm is fixed parameter tractable, parameterized by the number of vertices of the integer knapsack polytope |V |. This shows that the bin packing problem can be solved efficiently when the underlying integer knapsack polytope has an easy structure, i.e. has a small number of vertices. Furthermore, we show that the presented bounds of the structure theorem are asymptotically tight. We give a construction of bin packing instances using new structural insights and classical number theoretical theorems which yield the desired lower bound.
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملNecessary and Sufficient Conditions for Stability of a Bin-packing System
Objects of various integer sizes, o,, o , are to be packed together into bins of size N as they arrive at a service facility. The number of objects of size o, which arrive by time t is A , where the components of A' = (A , * , A ')' are independent renewal processes, with A'/t A as t --oo. The empty space in those bins which are neither empty nor full at time t is called the wasted space and th...
متن کاملComaprison of Mass-Transfer Efficiencies of Scc and Structured Packing
In a previous paper, pressure drop, flooding and mass-transfer characteristics of a novel pilot-scale distillation column called spinning cone column (SCC) were presented. Here, we present the result of comparison of mass-transfer efficiencies of SCC and structured packing. Comparison of SCC and structured packing mass-transfer characteristics show that the gas and liquid-side height of transfe...
متن کاملAbstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...
متن کاملBranch and Price for Chance Constrained Bin Packing
This article considers two versions of the stochastic bin packing problem with chance constraints. In the first version, we formulate the problem as a two-stage stochastic integer program that considers item-tobin allocation decisions in the context of chance constraints on total item size within the bins. Next, we describe a distributionally robust formulation of the problem that assumes the i...
متن کامل