Generalized Covering Relaxation for 0-1 Programs.

Abstract

A general purpose algorithm is constructed for solving polynomial 0-1 programming problems. The algorithm is applied directly to the polynomial problem in its original form. Further, no additional variables are introduced in the solution process. The algorithm was tested on randomly generated modest size problems and the preliminary computational results obtained are very encouraging.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1978
Accession Number
ADA060851

Entities

People

  • Daniel Granot
  • Frieda Granot

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computations
  • Computer Programming
  • Contracts
  • Coverings
  • Inequalities
  • Integer Programming
  • Iterations
  • Military Research
  • Operations Research
  • Polynomials
  • Sequences
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research