Solving the weighted MAX-SAT problem using the dynamic convexized method

DOI10.1007/s11590-012-0583-4zbMath1288.90082MaRDI QIDQ2439524

Yuanhui Yan, Wen-Xing Zhu

Publication date: 14 March 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0583-4

zbMATH Keywords

local minimizer; MAX-SAT; dynamic convexized method; weighted maximum satisfiability

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On randomizing two derandomized greedy algorithms
• An efficient solver for weighted Max-SAT
• A discrete dynamic convexized method for nonlinear integer programming
• Solving weighted MAX-SAT via global equilibrium search
• Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
• Approximation algorithms for combinatorial problems
• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
• Guided local search for solving SAT and weighted MAX-SAT problems
• A discrete dynamic convexized method for VLSI circuit partitioning
• GRASP with path relinking for the weighted MAXSAT problem
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• Algorithmic aspects in speech recognition
• Theory and Applications of Satisfiability Testing
• Approximation and Online Algorithms
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004