scientific article; zbMATH DE number 1954176

MaRDI QIDQ4415205zbMATH OpenFDO

Authors

Publication date 28 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2557/25570603.htm

Mathematics Subject Classification ID

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

Recommendations

• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
• On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
• New local search approximation techniques for maximum generalized satisfiability problems
• Local search algorithms for SAT: an empirical evaluation
• New local search methods for partial MaxSAT

Cited in

(10)

• A discrete Lagrangian-based global-search method for solving satisfiability problems
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
• New local search methods for partial MaxSAT
• scientific article; zbMATH DE number 1943828 (Why is no real title available?)
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• scientific article; zbMATH DE number 7310195 (Why is no real title available?)
• ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH
• ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
• Integrating multi-armed bandit with local search for MaxSAT
• Enhancing MaxSAT local search via a unified soft clause weighting scheme

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4415205)