A polyhedral approach to maximum 2-satisfiability
Conference
·
OSTI ID:35929
- Univ. of Waterloo (Canada)
The maximum 2-satisfiability problem is: Given Boolean variables and a list of clauses of length one or two, to find values for the variables so as to maximize the number (or weight) of satisfied clauses. We will describe some linear programming bounds, in particular some classes of inequalities for which the separation problem can be solved efficiently, and some other polyhedral results for this problem.
- OSTI ID:
- 35929
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Computational results on an LP and rounding approach to Max 2SAT
Satisfiability of logic programming based on radial basis function neural networks
Polyhedral results for the uncapacitated facility location problem: Lifting and separation
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35897
Satisfiability of logic programming based on radial basis function neural networks
Journal Article
·
Thu Jul 10 00:00:00 EDT 2014
· AIP Conference Proceedings
·
OSTI ID:22306155
Polyhedral results for the uncapacitated facility location problem: Lifting and separation
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35747