Boolean and Graph Theoretic Formulation of the Simple Plant Location Problem.

Abstract

The simple plant location problem is formulated as the minimization of a pseudo-Boolean functions. This form of the problem is then transformed into a set covering problem and also into a weighted vertex packing problem on a graph. These formulations are compared to similar formulations in the literature and to the 'standard' integer programming formulation. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1987
Accession Number
ADA184702

Entities

People

  • B. Simeone
  • P. L. Hammer
  • P. M. Dearing

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Availability
  • Classification
  • Coefficients
  • Computer Programming
  • Continents
  • Coverings
  • Identities
  • Integer Programming
  • New York
  • Notation
  • Operations Research
  • Schools
  • Security
  • Standards
  • Technical Information Centers
  • Transportation
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research