An efficient solver for weighted Max-SAT
DOI10.1007/S10898-007-9166-9zbMATH Open1146.90480OpenAlexW2055714959WikidataQ61918774 ScholiaQ61918774MaRDI QIDQ933784FDOQ933784
Authors: Teresa Alsinet, Felip Manya, 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
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)
Cites Work
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A machine program for theorem-proving
- Title not available (Why is that?)
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for the maximum satisfiability problem
- New Upper Bounds for Maximum Satisfiability
- Exact algorithms for MAX-SAT
- Solving propositional satisfiability problems
- Title not available (Why is that?)
- Faster exact algorithms for hard problems: A parameterized point of view
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving Max-SAT as weighted CSP
- Algorithmic aspects in speech recognition
- Title not available (Why is that?)
- Principles and Practice of Constraint Programming – CP 2004
Cited In (25)
- A Spectral Method for MAX2SAT in the Planted Solution Model
- Polarity and variable selection heuristics for SAT-based anytime MaxSAT
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- Curriculum-based course timetabling with SAT and MaxSAT
- A logical approach to efficient Max-SAT solving
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
- Dynamic polynomial watchdog encoding for solving weighted MaxSAT
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
- Solving sparse instances of Max SAT via width reduction and greedy restriction
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Solving weighted MAX-SAT via global equilibrium search
- Solving the weighted MAX-SAT problem using the dynamic convexized method
- LMHS: a SAT-IP hybrid MaxSat solver
- Title not available (Why is that?)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Incomplete inference for graph problems
- Volt: a lazy grounding framework for solving very large MaxSAT instances
- Open-WBO: a modular MaxSAT solver
- Theory and Applications of Satisfiability Testing
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- Minimaxsat: an efficient weighted Max-SAT solver
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- MiFuMax -- a literate MaxSAT solver. System description
- The \textsc{WeightedCircuitsLmax} constraint
Uses Software
This page was built for publication: An efficient solver for weighted Max-SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q933784)
