Problems in Investigation Theory.

Abstract

Investigation theory treats discrete combinatorial optimization problems in which there are several objects passing through a region containing one or more investigators who are to investigate, according to some criteria, objects prior to their escape across a portion of the boundary of the region. In general, investigation times are sequence-dependent functions of the time investigation is initiated. This research treats problems with one investigator under the criteria of minimization of the number of objects to escape uninvestigated. Those problems for which optimal solutions can be efficiently obtained are identified and algorithms developed. For the general problem, heuristic solution methods are suggested and evaluated through comparison of results obtained with optimal solutions. (Modified author abatract)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1973
Accession Number
AD0761390

Entities

People

  • Stephen John Balut

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Heuristic Methods
  • Mathematics
  • Optimization

Readers

  • Operations Research
  • Systems Analysis and Design