CHAMP: a multipass algorithm for Max Sat based on saver variables
From MaRDI portal
Publication:2688471
DOI10.1016/j.disopt.2023.100760zbMath1506.68119OpenAlexW4317756867MaRDI QIDQ2688471
Shahar Golan, Yochai Twitto, Daniel Berend
Publication date: 3 March 2023
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2023.100760
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GitHub
- SAT-based MaxSAT algorithms
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- A threshold for unsatisfiability
- Tight bound on Johnson's algorithm for maximum satisfiability
- A novel algorithm for Max Sat calling MOCE to order
- A tutorial on the cross-entropy method
- Experimental results on the crossover point in random 3-SAT
- Proof of the Satisfiability Conjecture for Large k
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Bounds on Greedy Algorithms for MAX SAT
- Solving Satisfiability with Less Searching
- Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Sharp thresholds of graph properties, and the $k$-sat problem
- The Reactive Tabu Search
- On the Approximation of Maximum Satisfiability
- Random MAX SAT, random MAX CUT, and their phase transitions
- The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
- The asymptotic k-SAT threshold
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
- Threshold values of random K‐SAT from the cavity method
- On a combinatorial game
This page was built for publication: CHAMP: a multipass algorithm for Max Sat based on saver variables
