An Approximate Binary Search Algorithm for the Multiple-Choice Knapsack Problem

George Gens, Eugene Levner. An Approximate Binary Search Algorithm for the Multiple-Choice Knapsack Problem. Inf. Process. Lett., 67(5):261-265, 1998. [doi]

Abstract

Abstract is missing.