A Generalized Set-Covering Method for Surveillance Maintenance

Abstract

This research has developed a solution procedure for a practical, new combinatorial optimization problem. The solution procedure also represents a new approach to combinatorial problems. This problem is a model for certain surveillance maintenance problems, and has not previously appeared in the literature of optimization or industrial engineering. A heuristic procedure for the generalized set-covering problem is described. Computational experiments are presented and a computer code (in Microsoft C) for the procedure is given. This heuristic procedure represents a new approach to discrete optimization -- a nonlinear programming approach. This approach should be very useful in 'solving' a host of NP-complete problems with nonlinear objective functions. To make the results of this research address real world, certain extensions are suggested.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1991
Accession Number
ADA236855

Entities

People

  • Lester Frair
  • Samuel Awoniyi

Tags

Communities of Interest

  • Sensors

DTIC Thesaurus Topics

  • Algorithms
  • C Programming Language
  • Computational Complexity
  • Computer Programming
  • Computer Programs
  • Computers
  • Contracts
  • Deployment
  • Digital Computers
  • Engineering
  • Finite Element Analysis
  • Industrial Engineering
  • Language
  • Nonlinear Programming
  • Operating Systems
  • Procedures (Computers)
  • Three Dimensional

Fields of Study

  • Mathematics

Readers

  • Operations Research