title: 3 dimensional bin packing algorithms
body: <p>I'm faced with a 3 dimensional bin packing problem and am currently conducting some preliminary research as to which algorithms/heuristics are currently yielding the best results. Since the problem is NP hard I do not expect to find the optimal solution in every case, but I was wondering:  </p>
  
  <p>1) what are the best exact solvers? Branch and Bound? What problem instance sizes can I expect to solve with reasonable computing resources?<br>
  2) what are the best heuristic solvers?<br>
  3) What off-the-shelf solutions exist to conduct some experiments with?  </p>