Pages that link to "Item:Q5326460"

The following pages link to Exploiting the Power of mip Solvers in maxsat (Q5326460):

Displaying 19 items.

• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
• Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
• A constraint optimization approach to causal discovery from subsampled time series data (Q1678425) (← links)
• WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
• \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
• Clause redundancy and preprocessing in maximum satisfiability (Q2104499) (← links)
• Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
• Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach (Q2302940) (← links)
• Improved WPM encoding for coalition structure generation under MC-nets (Q2331103) (← links)
• Multi-language evaluation of exact solvers in graphical model discrete optimization (Q2398440) (← links)
• Computational protein design as an optimization problem (Q2453727) (← links)
• LMHS: A SAT-IP Hybrid MaxSAT Solver (Q2818041) (← links)
• Pakota: A System for Enforcement in Abstract Argumentation (Q2835885) (← links)
• Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
• (Q4637032) (← 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)
• Resizing cardinality constraints for MaxSAT (Q5145443) (← links)
• Computing generating sets of minimal size in finite algebras (Q6108373) (← links)