An efficient solver for weighted Max-SAT
From MaRDI portal
Publication:933784
DOI10.1007/s10898-007-9166-9zbMath1146.90480OpenAlexW2055714959WikidataQ61918774 ScholiaQ61918774MaRDI QIDQ933784
Teresa Alsinet, Felip Manyà, Jordi Planes
Publication date: 25 July 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10459.1/46634
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
Boosting branch-and-bound MaxSAT solvers with clause learning ⋮ Incomplete inference for graph problems ⋮ Solving the weighted MAX-SAT problem using the dynamic convexized method ⋮ Curriculum-based course timetabling with SAT and MaxSAT ⋮ A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for the maximum satisfiability problem
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Solving propositional satisfiability problems
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- New Upper Bounds for Maximum Satisfiability
- Exact Algorithms for MAX-SAT
- Algorithmic aspects in speech recognition
- A machine program for theorem-proving
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2004
- Faster exact algorithms for hard problems: A parameterized point of view
This page was built for publication: An efficient solver for weighted Max-SAT
