An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improving configuration checking for satisfiable random \(k\)-SAT instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: WPM3: an (in)complete algorithm for weighted partial MaxSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting subproblem optimization in SAT-based maxsat algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Community Structure of SAT Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems / 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: Local search with edge weighting and configuration checking heuristics for minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with path relinking for the weighted MAXSAT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithms and the Optimal Allocation of Trials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624095 / 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: A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank

Latest revision as of 06:05, 18 July 2024

scientific article
Language Label Description Also known as
English
An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
scientific article

    Statements

    An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    combinatorial optimization
    0 references
    maximum satisfiability
    0 references
    local search
    0 references
    path-breaking
    0 references
    mutation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references