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.
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;
Journal_Title :
Electronic Computers, IEEE Transactions on
DOI :
10.1109/PGEC.1967.264675
