The Inequality-Satisfiability problem - Semantic Scholar
The Inequality-Satisfiability problem Dorit S. Hochbaum ∗ Department of Industrial Engineering and Operations Research and Walter A. Haas School of Business, University of California, Berkeley email: [email protected] Erick Moreno-Centeno † Department of Industrial Engineering and Operations Research University of California, Berkeley email: [email protected] May 30, 2007
Abstract We define a generalized variant of the satisfiability problem (SAT) where each “clause” is an or -list of inequalities in n variables. The inequality satisfiability problem (I-SAT) is to find whether there exists a feasible point in
Abstract We define a generalized variant of the satisfiability problem (SAT) where each “clause” is an or -list of inequalities in n variables. The inequality satisfiability problem (I-SAT) is to find whether there exists a feasible point in
