BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-75-518
       ENTRY:: August 23, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Aggregation of inequalities in integer programming.
        TYPE:: Technical Report
      AUTHOR:: Chvatal, Vaclav
      AUTHOR:: Hammer, Peter L.
        DATE:: August 1975
       PAGES:: 28
    ABSTRACT:: Given an m $\times$ n zero-one matrix $\underset\tilde\to A$
               we ask whether there is a single linear inequality
               $\underset\tilde\to a \underset\tilde\to x \leq b$ whose
               zero-one solutions are precisely the zero-one solutions of
               $\underset\tilde\to A \underset\tilde\to x \leq e$. We
               develop an algorithm for answering this question in O(m$n^2$)
               steps and investigate other related problems. Our results may
               be interpreted in terms of graph theory and threshold logic.
       NOTES:: [Adminitrivia V1/Prg/19950823]
         END:: STAN//CS-TR-75-518