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 Im 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, Im grateful for any information.
Recent insights on algorithms for 1D bin packing
ds.algorithms;co.combinatorics;approximation algorithms;time complexity