The inequality-satisfiability problem

Authors:
Dorit S. Hochbaum;Erick Moreno-Centeno
Affiliations:
Department of Industrial Engineering and Operations Research, 4181 Etcheverry Hall, Mail Code 1777, University of California, Berkeley, CA 94720-1777, USA and Walter A. Haas School of Business, Un ...;Department of Industrial Engineering and Operations Research, 4181 Etcheverry Hall, Mail Code 1777, University of California, Berkeley, CA 94720-1777, USA
Venue:
Operations Research Letters
Year:
2008

Citing 5
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
Decision criteria for computer-aided parting surface design

Computer-Aided Design
Separating an object from its cast

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On the complexity of computing the measure of ∪[ai,bi]

Communications of the ACM
Finding feasible mold parting directions using graphics hardware

Computer-Aided Design

Auditing a database under retention policies

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a generalization of the satisfiability problem (SAT) where each ''clause'' is an or-list of inequalities in n variables. This problem is NP-complete even when containing only two inequalities per ''clause'', but solvable in polynomial time when either the number of variables or the number of ''clauses'' is fixed.