Incomplete inference for graph problems
From MaRDI portal
Publication:1947627
DOI10.1007/s11590-012-0461-0zbMath1269.90128OpenAlexW1968292514MaRDI QIDQ1947627
Publication date: 23 April 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0461-0
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- An efficient solver for weighted Max-SAT
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Resolution for Max-SAT
- A fast algorithm for the maximum clique problem
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- A logical approach to efficient Max-SAT solving
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- A Max-SAT Inference-Based Pre-processing for Max-Clique
- New Upper Bounds for Maximum Satisfiability
- Optimal Protein Structure Alignment Using Maximum Cliques
- On Solving the Partial MAX-SAT Problem
- Principles and Practice of Constraint Programming – CP 2003
This page was built for publication: Incomplete inference for graph problems