This is a preview. Log in through your library . Abstract A general procedure is presented for computing the best, 2nd best, ⋯, Kth best solutions to a given discrete optimization problem. If the ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...