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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback