• DocumentCode
    891321
  • Title

    Gimpel´s Reduction Technique Extended to the Covering Problem with Costs

  • Author

    Robinson, Stanley U. ; House, Robert W.

  • Author_Institution
    Bolt Beranek and Newman Inc., Cambridge, Mass.
  • Issue
    4
  • fYear
    1967
  • Firstpage
    509
  • Lastpage
    514
  • Abstract
    A new reduction technique conceived by Gimpel can be applied to any covering problem with costs that has a column with exactly two 1´s, in rows of equal cost. Gimpel´s plurality restriction is unnecessary. The technique is illustrated and proved.
  • Keywords
    Costs; Boolean function; covering problem with costs; integer linear programming; logic network; minimum-cost representation of Boolean function; prime implicant table; reduction method for covering problem with costs;
  • fLanguage
    English
  • Journal_Title
    Electronic Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0367-7508
  • Type

    jour

  • DOI
    10.1109/PGEC.1967.264675
  • Filename
    4039118
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=891321