A novel algorithm for Max Sat calling MOCE to order
From MaRDI portal
Publication:2149880
DOI10.1007/978-3-030-92681-6_25MaRDI QIDQ2149880
Daniel Berend, Yochai Twitto, Shahar Golan
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_25
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SAT-based MaxSAT algorithms
- Tight bound on Johnson's algorithm for maximum satisfiability
- A tutorial on the cross-entropy method
- Experimental results on the crossover point in random 3-SAT
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Bounds on Greedy Algorithms for MAX SAT
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Random MAX SAT, random MAX CUT, and their phase transitions
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
- Some optimal inapproximability results
- Threshold values of random K‐SAT from the cavity method
- On a combinatorial game