WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2017.05.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2621108739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Protein Structure Alignment Using Maximum Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curriculum-based course timetabling with SAT and MaxSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ``logic-constrained'' knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-based MaxSAT algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative and core-guided maxsat solving: a survey and assessment / 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: CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability / 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: Exploiting Cycle Structures in Max-SAT / 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: Algorithms for Weighted Boolean Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2786911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements to Core-Guided Binary Search for MaxSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality networks: a theoretical and empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsatisfiability-based optimization in clasp / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for Max-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Encodings of Pseudo-Boolean Constraints into CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaxSAT by improved instance-specific algorithm configuration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting the Power of mip Solvers in maxsat / rank
 
Normal rank

Latest revision as of 18:21, 14 July 2024

scientific article
Language Label Description Also known as
English
WPM3: an (in)complete algorithm for weighted partial MaxSAT
scientific article

    Statements

    WPM3: an (in)complete algorithm for weighted partial MaxSAT (English)
    0 references
    0 references
    0 references
    16 November 2017
    0 references
    0 references
    optimization
    0 references
    MaxSAT
    0 references
    SAT
    0 references
    pseudo-Boolean constraints
    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