Branch-and-bound algorithms are adequate for the solution of a wide range of 0-1 knapsack problems. It is shown that the simplest method of branching is as good as any. However, problems with highly ...

The original version of this story appeared in Quanta Magazine. Computer scientists often deal with abstract problems that are hard to comprehend, but an exciting new algorithm matters to anyone who ...