New local search methods for partial MaxSAT
From MaRDI portal
Recommendations
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- A taxonomy of exact methods for partial Max-SAT
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- On Solving the Partial MAX-SAT Problem
Cites work
- scientific article; zbMATH DE number 1954176 (Why is no real title available?)
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
- CCAnr: a configuration checking based local search solver for non-random satisfiability
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Controlling a solver execution with the runsolver Tool
- Cores in core based MaxSat algorithms: an analysis
- Exploiting Cycle Structures in Max-SAT
- Haplotype inference with pseudo-Boolean optimization
- Improving stochastic local search for SAT with a new probability distribution
- Iterative and core-guided maxsat solving: a survey and assessment
- Local search for Boolean satisfiability with configuration checking and subscore
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- MaxSAT by improved instance-specific algorithm configuration
- Minimaxsat: an efficient weighted Max-SAT solver
- New inference rules for Max-SAT
- On Solving the Partial MAX-SAT Problem
- Open-WBO: a modular MaxSAT solver
- Paramils: an automatic algorithm configuration framework
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Principles and practice of constraint programming. 20th international conference, CP 2014, Lyon, France, September 8--12, 2014. Proceedings
- QMaxSAT: A partial Max-SAT solver
- SAT-based MaxSAT algorithms
- Stochastic local search. Foundations and applications.
- The first and second Max-SAT evaluations
- Theory and Applications of Satisfiability Testing
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
Cited in
(14)- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
- A taxonomy of exact methods for partial Max-SAT
- New heuristic approaches for maximum balanced biclique problem
- Cooperative parallel SAT local search with path relinking
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Core-boosted linear search for incomplete MaxSAT
- Using merging variables-based local search to solve special variants of MaxSAT problem
- scientific article; zbMATH DE number 1954176 (Why is no real title available?)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- On Solving the Partial MAX-SAT Problem
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Integrating multi-armed bandit with local search for MaxSAT
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
- Using the method of conditional expectations to supply an improved starting point for CCLS
Describes a project that uses
Uses Software
This page was built for publication: New local search methods for partial MaxSAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329035)
