Pages that link to "Item:Q3637180"

The following pages link to Exploiting Cycle Structures in Max-SAT (Q3637180):

Displaying 16 items.

• New local search methods for partial MaxSAT (Q329035) (← links)
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
• Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
• Resolution-based lower bounds in MaxSAT (Q606913) (← links)
• A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
• Extending linear relaxation for non-square matrices and soft constraints (Q738985) (← links)
• Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (Q905995) (← links)
• WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
• A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
• Learning hierarchical task network domains from partially observed plan traces (Q2453731) (← links)
• Maximum likelihood model based on minor allele frequencies and weighted Max-SAT formulation for haplotype assembly (Q2632793) (← links)
• Breaking Cycle Structure to Improve Lower Bound for Max-SAT (Q4632177) (← links)
• ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
• Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
• MaxSAT resolution for regular propositional logic (Q6066845) (← links)