A Study of Heuristic Algorithm.

Abstract

The authors study a simplified version of the knapsak problem for which both exact algorithms and heuristic algorithms are known. A necessary and sufficient condition for the validity of the heuristic algorithm is derived. Also a simple sufficient condition is derived. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1974
Accession Number
AD0787724

Entities

People

  • M. L. Lenard
  • T. C. Hu

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms

Fields of Study

  • Computer science

Readers

  • Operations Research