Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
From MaRDI portal
Publication:1850970
DOI10.1023/A:1011306011437zbMath1041.68091OpenAlexW1533196865MaRDI QIDQ1850970
Toshihide Ibaraki, Mutsunori Yagiura
Publication date: 15 December 2002
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011306011437
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (9)
SAT-Based Formula Simplification ⋮ Relaxation heuristics for the set multicover problem with generalized upper bound constraints ⋮ A GRASP algorithm to solve the unicost set covering problem ⋮ Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems ⋮ Continuous functions minimization by dynamic random search technique ⋮ Improving genetic algorithms' performance by local search for continuous function optimization ⋮ Efficient branch-and-bound algorithms for weighted MAX-2-SAT ⋮ A 3-flip neighborhood local search for the set covering problem ⋮ Solving weighted MAX-SAT via global equilibrium search
Uses Software
This page was built for publication: Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
