Efficient Frontiers for Nonlinear Multidimensional Knapsack Problems.

摘要

An efficient recursive enumeration procedure is described for finding the complete family of efficient, or undominated, solutions for general separable multidimensional 'knapsack' problems. A generalization of the Gilmore-Gomory procedure provides an alternative view of the Morin-Marsten method that admits an algorithm requiring significantly less computer storage and computational overhead. We illustrate the procedure with a highly nonlinear example. (Author)