CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability

From MaRDI portal
Publication:2982183

DOI10.1109/TC.2014.2346196zbMath1360.68786MaRDI QIDQ2982183

Kaile Su, Chuan Luo, Wei Wu, Shaowei Cai, Zhong Jie

Publication date: 16 May 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)




Related Items (27)

Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT InstancesA novel algorithm for Max Sat calling MOCE to orderNew local search methods for partial MaxSATAn efficient local search algorithm for solving maximum edge weight clique problem in large graphsAn Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability ProblemWPM3: an (in)complete algorithm for weighted partial MaxSATMLQCC: an improved local search algorithm for the set k‐covering problemImproved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanismCHAMP: a multipass algorithm for Max Sat based on saver variablesGo-MOCE: greedy order method of conditional expectations for Max SatOld techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiabilityAn efficient heuristic algorithm for solving connected vertex cover problemAn iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problemBreaking Cycle Structure to Improve Lower Bound for Max-SAT\(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problemsNew stochastic local search approaches for computing preferred extensions of abstract argumentationCCEHC: an efficient local search algorithm for weighted partial maximum satisfiabilityAn improved configuration checking-based algorithm for the unicost set covering problemLocal search for diversified top-\(k\) clique search problemProbabilistic characterization of random Max \(r\)-SatSCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problemThe Normalized Autocorrelation Length of Random Max  $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$Cooperative parallel SAT local search with path relinkingCCLSVoting on multi-issue domains with conditionally lexicographic preferencesUsing the method of conditional expectations to supply an improved starting point for CCLSOpen-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT




This page was built for publication: CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability