A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
From MaRDI portal
Publication:734870
DOI10.1016/j.amc.2009.06.043zbMath1179.90234OpenAlexW1987470888MaRDI QIDQ734870
Publication date: 14 October 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.06.043
Related Items (4)
An improved exact algorithm for least-squares unidimensional scaling ⋮ A new upper bound for Max-2-SAT: A graph-theoretic approach ⋮ Incomplete inference for graph problems ⋮ Iterative and core-guided maxsat solving: a survey and assessment
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improving exact algorithms for MAX-2-SAT
- An efficient solver for weighted Max-SAT
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Iterated tabu search for the maximum diversity problem
- AI 2007: Advances in artificial intelligence. 20th Australian joint conference on artificial intelligence, Gold Coast, Australia, December 2--6, 2007. Proceedings
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Semidefinite programming based approaches to the break minimization problem
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- Tabu Search—Part I
- On the Approximation of Maximum Satisfiability
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On the recursive largest first algorithm for graph colouring
- Experimental and Efficient Algorithms
- Principles and Practice of Constraint Programming – CP 2003
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Faster exact algorithms for hard problems: A parameterized point of view
This page was built for publication: A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
