CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
From MaRDI portal
(Redirected from Publication:502391)
Recommendations
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- New local search methods for partial MaxSAT
- Guided local search for solving SAT and weighted MAX-SAT problems
- Guided local search for solving SAT and weighted MAX-SAT problems
- Reactive local search techniques for the maximum k-conjunctive constraint satisfaction problem (MAX-k-CCSP)
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Tight bounds on local search to approximate the maximum satisfiability problems
- An efficient solver for weighted Max-SAT
- A cooperative search method for the weighted Max-Sat problems
- New local search approximation techniques for maximum generalized satisfiability problems
Cites work
- scientific article; zbMATH DE number 1954176 (Why is no real title available?)
- scientific article; zbMATH DE number 1448978 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- An electromagnetism metaheuristic for the unicost set covering problem
- Beitrag zur Theorie des Ferromagnetismus
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Computational protein design as an optimization problem
- Concurrent Structure-Independent Fault Detection Schemes for the Advanced Encryption Standard
- Controlling a solver execution with the runsolver Tool
- Exploiting Cycle Structures in Max-SAT
- GRASP: a search algorithm for propositional satisfiability
- Improving local search for random 3-SAT using quantitative configuration checking
- Local search for Boolean satisfiability with configuration checking and subscore
- Many hard examples in exact phase transitions
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- Neighbourhood Clause Weight Redistribution in Local Search for SAT
- New local search methods for partial MaxSAT
- NuMVC: an efficient local search algorithm for minimum vertex cover
- Parallel AES Encryption Engines for Many-Core Processor Arrays
- Paramils: an automatic algorithm configuration framework
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
- SAT-based MaxSAT algorithms
- Scoring functions based on second level score for \(k\)-SAT with long clauses
- Solving Satisfiability with Less Searching
- Stochastic local search. Foundations and applications.
Cited in
(13)- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses
- Cooperative parallel SAT local search with path relinking
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- CCEHC
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- A refined branching algorithm for the maximum satisfiability problem
- New local search methods for partial MaxSAT
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem
- Integrating multi-armed bandit with local search for MaxSAT
- Using the method of conditional expectations to supply an improved starting point for CCLS
This page was built for publication: CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502391)
