Efficient Frontiers for Nonlinear Multidimensional Knapsack Problems.

Abstract

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1979
Accession Number
ADA068390

Entities

People

  • Jonathan S. Yormark

Organizations

  • University of Southern California

Tags

Communities of Interest

  • Air Platforms
  • Autonomy

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • California
  • Commerce
  • Computations
  • Computer Programming
  • Computers
  • Dynamic Programming
  • Finance
  • Low Density
  • Military Research
  • Operations Research
  • Sequences
  • United States
  • United States Government

Fields of Study

  • Mathematics

Readers

  • Operations Research