Using the method of conditional expectations to supply an improved starting point for CCLS
type: Item
instance of: scholarly article
title: Using the method of conditional expectations to supply an improved starting point for CCLS
zbMATH Open document ID: 1505.90097
author: Daniel Berend
author: Shahar Golan
author: Yochai Twitto
published in: Journal of Combinatorial Optimization
publication date: 2022-10-31T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7610148
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: maximum satisfiability
zbMATH Keywords: method of conditional expectations
zbMATH Keywords: local search
describes a project that uses: QMaxSAT
describes a project that uses: Sat4j
describes a project that uses: MaxHS
describes a project that uses: CCASat
describes a project that uses: MiniMaxSat
describes a project that uses: Walksat
MaRDI profile type: Publication
full work available at URL: s10878-022-00907-5
OpenAlex ID: W4298132557
cites work: Improving configuration checking for satisfiable random \(k\)-SAT instances
cites work: The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
cites work: On the classification of NP-complete problems in terms of their correlation coefficient
cites work: On the landscape ruggedness of the quadratic assignment problem
cites work: SAT-based MaxSAT algorithms
cites work: Solving (Weighted) Partial MaxSAT through Satisfiability Testing
cites work: Q4258216
cites work: The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
cites work: Q5503674
cites work: A tutorial on the cross-entropy method
cites work: Local search for Boolean satisfiability with configuration checking and subscore
cites work: New local search methods for partial MaxSAT
cites work: Improved exact algorithms for MAX-SAT
cites work: Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP
cites work: Autocorrelation measures for the quadratic assignment problem
cites work: Q4228436
cites work: The asymptotic k-SAT threshold
cites work: Random MAX SAT, random MAX CUT, and their phase transitions
cites work: Q5365069
cites work: Experimental results on the crossover point in random 3-SAT
cites work: Q2770544
cites work: Proof of the Satisfiability Conjecture for Large k
cites work: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
cites work: On a combinatorial game
cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
cites work: Sharp thresholds of graph properties, and the $k$-sat problem
cites work: The traveling salesman problem and its variations
cites work: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
cites work: Some optimal inapproximability results
cites work: Q3624109
cites work: Q5472387
cites work: QMaxSAT: A partial Max-SAT solver
cites work: Q3624095
cites work: A refined branching algorithm for the maximum satisfiability problem
cites work: CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
cites work: Combining simulated annealing with local search heuristics
cites work: Threshold values of random K‐SAT from the cavity method
cites work: Guided local search for solving SAT and weighted MAX-SAT problems
cites work: New Upper Bounds for Maximum Satisfiability
cites work: On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
cites work: Bounds on Greedy Algorithms for MAX SAT
cites work: Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
cites work: Theory and Applications of Satisfiability Testing
cites work: On the Approximation of Maximum Satisfiability
cites work: Effect of initial assignment on local search performance for Max Sat
DOI: 10.1007/S10878-022-00907-5
description: scientific article; zbMATH DE number 7610148