Solving weighted MAX-SAT via global equilibrium search

DOI10.1016/j.orl.2007.11.007zbMath1155.90433OpenAlexW2026591463MaRDI QIDQ1003491

Vladimir P. Shylo, Oleg A. Prokopyev, Oleg V. Shylo

Publication date: 4 March 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.11.007

zbMATH Keywords

heuristicsglobal equilibrium searchweighted maximum satisfiability

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Related Items

Solving the weighted MAX-SAT problem using the dynamic convexized method, Solving the maxcut problem by the global equilibrium search, Solving weighted MAX-SAT via global equilibrium search

Uses Software

• DIMACS
• Tabu search

Cites Work

• Algorithms for the maximum satisfiability problem
• Solving weighted MAX-SAT via global equilibrium search
• Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
• Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
• Guided local search for solving SAT and weighted MAX-SAT problems
• Problems of discrete optimization: challenges and main approaches to solve them
• GRASP with path relinking for the weighted MAXSAT problem
• Complexity of Partial Satisfaction
• Global equilibrium search applied to the unconstrained binary quadratic optimization problem
• Algorithmic aspects in speech recognition
• Handbook of metaheuristics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item