<p>This is just a general question on recent algorithms for the 1D bin packing problem. I just want to collect some information on this issue, so I’m grateful for any information. Especially heuristics solving the problem but also exact algorithms.</p>

<p>I know about the Bin Completion algorithm by Korf and the recent developments in Branch-and-Price algorithms. But is there anything else? As said before, I’m grateful for any information.</p>

CC BY-SA 3.0
2014-12-05T02:43:05.287Z
Are you interested in approximation algorithms? Thomas Rotvhoss recently showed how to compute a solution that uses at most $OPT + O(\log OPT \log \log OPT)$ number of bins in polynomial time.
Sasho Nikolov
CC BY-SA 3.0
2014-12-06T13:39:07.227Z
Thanks, thats exactly the kind of information I'm looking for.
Dave
<ds.algorithms><co.combinatorics><approximation-algorithms><time-complexity>
Recent insights on algorithms for 1D bin packing
Dave
# Recent insights on algorithms for 1D bin packing

(Asked by: username_0 on 2014-12-04)

This is just a general question on recent algorithms for the 1D bin packing problem. I just want to collect some information on this issue, so I’m grateful for any information. Especially heuristics solving the problem but also exact algorithms.

I know about the Bin Completion algorithm by Korf and the recent developments in Branch-and-Price algorithms. But is there anything else? As said before, I’m grateful for any information.

**Tags:** ds.algorithms, co.combinatorics, approximation-algorithms, time-complexity
> **Comments:**
> **username_1**: Are you interested in approximation algorithms? Thomas Rotvhoss recently showed how to compute a solution that uses at most $OPT + O(\log OPT \log \log OPT)$ number of bins in polynomial time.  
> **username_0**: Thanks, thats exactly the kind of information I'm looking for.  

---

## 0 answers

