Incomplete inference for graph problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1947416 (Why is no real title available?)
- scientific article; zbMATH DE number 1786225 (Why is no real title available?)
- 2006 and 2007 Max-SAT evaluations: contributed instances
- A Max-SAT Inference-Based Pre-processing for Max-Clique
- A fast algorithm for the maximum clique problem
- A logical approach to efficient Max-SAT solving
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- An efficient solver for weighted Max-SAT
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- Minimaxsat: an efficient weighted Max-SAT solver
- New Upper Bounds for Maximum Satisfiability
- New inference rules for Max-SAT
- On Solving the Partial MAX-SAT Problem
- Optimal Protein Structure Alignment Using Maximum Cliques
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Resolution for Max-SAT
- Solving Max-SAT as weighted CSP
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
- The first and second Max-SAT evaluations
Cited in
(2)
This page was built for publication: Incomplete inference for graph problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947627)