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