Combinatorial optimization with Boolean constraints

Technical Report · Tue Feb 01 00:00:00 EST 1983

OSTI ID:6367954

Hulme, B L; Worrell, R B

This report shows how Boolean algebraic formula manipulation can be used to solve certain kinds of optimization problems. If the problem can be formulated in terms of 0 to 1 variables and if the feasible solutions can be described by a Boolean equation, then the method of this report can be used. The method generates feasible solutions algebraically as terms of a disjunctive normal form of a Boolean function. Many small sample problems are solved to illustrate the method and the practical situations in which these optimization problems arise.

• Research Organization: Sandia National Labs., Albuquerque, NM (USA)
• DOE Contract Number: AC04-76DP00789
• OSTI ID: 6367954
• Report Number(s): SAND-83-0085; ON: DE83010387
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
OPTIMIZATION
SET THEORY
ALGEBRA
COMPUTER CALCULATIONS
WEIGHTING FUNCTIONS
FUNCTIONS
MATHEMATICS
990200* - Mathematics & Computers