A novel algorithm for Max Sat calling MOCE to order

DOI10.1007/978-3-030-92681-6_25OpenAlexW4206615854MaRDI 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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

CHAMP: a multipass algorithm for Max Sat based on saver variables

Uses Software

• Walksat
• Sat4j
• QMaxSAT
• CCLS

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

This page was built for publication: A novel algorithm for Max Sat calling MOCE to order