Hello,

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.

asked 03 Dec '14, 15:40

Dave's gravatar image

Dave
312
accept rate: 0%

Be the first one to answer this question!
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "Title")
  • image?![alt text](/path/img.jpg "Title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported

Tags:

×28
×18
×7

Asked: 03 Dec '14, 15:40

Seen: 788 times

Last updated: 03 Dec '14, 15:40

OR-Exchange! Your site for questions, answers, and announcements about operations research.