Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: QMaxSAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sat4j / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MaxHS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CCASat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniMaxSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Walksat / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-022-00907-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4298132557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving configuration checking for satisfiable random \(k\)-SAT instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the classification of NP-complete problems in terms of their correlation coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the landscape ruggedness of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-based MaxSAT algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving (Weighted) Partial MaxSAT through Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Normalized Autocorrelation Length of Random Max  $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on the cross-entropy method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for Boolean satisfiability with configuration checking and subscore / rank
 
Normal rank
Property / cites work
 
Property / cites work: New local search methods for partial MaxSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved exact algorithms for MAX-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autocorrelation measures for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic k-SAT threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random MAX SAT, random MAX CUT, and their phase transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental results on the crossover point in random 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Satisfiability Conjecture for Large k / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp thresholds of graph properties, and the $k$-sat problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2786911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refined branching algorithm for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining simulated annealing with local search heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold values of random <i>K</i>‐SAT from the cavity method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided local search for solving SAT and weighted MAX-SAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds for Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Greedy Algorithms for MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Maximum Satisfiability / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:15, 30 July 2024

scientific article
Language Label Description Also known as
English
Using the method of conditional expectations to supply an improved starting point for CCLS
scientific article

    Statements

    Using the method of conditional expectations to supply an improved starting point for CCLS (English)
    0 references
    0 references
    0 references
    0 references
    31 October 2022
    0 references
    combinatorial optimization
    0 references
    maximum satisfiability
    0 references
    method of conditional expectations
    0 references
    local search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers