Aggregation of Inequalities in Integer Programming.
STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
Given an m x n zero-one matrix A approximately it is asked whether there is a single linear inequality ax less than or equal to b whose zero-one solutions are precisely the zero-one solutions of Ax less than or equal to e. An algorithm is developed for answering this question in Omn sq steps and other related problems are investigated. The results may be interpreted in terms of graph theory and threshold logic.
- Theoretical Mathematics