# Polynomiality for Bin Packing with a Constant Number of Item Types

```@inproceedings{Goemans2014PolynomialityFB,
title={Polynomiality for Bin Packing with a Constant Number of Item Types},
author={Michel X. Goemans and Thomas Rothvoss},
booktitle={SODA},
year={2014}
}```
• Published in SODA 19 July 2013
• Computer Science, Mathematics
We consider the bin packing problem with d different item sizes s_i and item multiplicities a_i, where all numbers are given in binary encoding. This problem formulation is also known as the 1-dimensional cutting stock problem. In this work, we provide an algorithm which, for constant d, solves bin packing in polynomial time. This was an open problem for all d >= 3. In fact, for constant d our algorithm solves the following problem in polynomial time: given two d-dimensional polytopes P and Q…
72 Citations
About the Structure of the Integer Cone and its Application to Bin Packing
• Mathematics
SODA
• 2017
An algorithm for the bin packing problem with running time 2O(d) · enc(I)O(1) is obtained, parameterized by the number of vertices of the integer knapsack polytope |V|, which shows that the binpacking problem can be solved efficiently when the underlying integerknapsackpolytope has an easy structure.
Multidimensional Bin Packing and Other Related Problems : A Survey ∗
• Computer Science
• 2016
This survey considers several classical generalizations of bin packing problem such as geometric bin packing, vector bin packing and various other related problems such as vector scheduling, vector covering etc.
Solving Packing Problems with Few Small Items Using Rainbow Matchings
• Computer Science
MFCS
• 2020
A colored matching problem is introduced to which fixed-parameter algorithms for vector versions of Bin Packing, Multiple Knapsack, and Bin Covering parameterized by \$k are reduced, and the algorithms are randomized with one-sided error and run in time.
High Multiplicity Strip Packing Problem With Three Rectangle Types
The two-dimensional strip packing problem (2D-SPP) involves packing a set R = {r1, ..., rn} of n rectangular items into a strip of width 1 and unbounded height, where each rectangular item ri has
Knapsack and Subset Sum with Small Items
• Computer Science
ICALP
• 2021
These algorithms work for the more general problem variants with multiplicities, where each input item comes with a (binary encoded) multiplicity, which succinctly describes how many times the item appears in the instance.
High Multiplicity Scheduling on Uniform Machines in FPT-Time
• Computer Science
ArXiv
• 2022
This work considers scheduling on uniform machines where a job of size pj takes time pj/si on a machine of speed si and proposes an O(smax · p 3) max poly|I|) time algorithm, which is better than the running times of the algorithms known until today.
Beating the Harmonic lower bound for online bin packing
• Computer Science
ICALP
• 2016
This paper presents an online bin packing algorithm with asymptotic competitive ratio of 1.5813, the first improvement in fifteen years and reduces the gap to the lower bound by 15%.