An algorithm based on tabu search for satisfiability problem

DOI10.1007/BF02947312zbMath1005.68049MaRDI QIDQ1613279

Wenqi Huang, Houxiang Wang, Defu Zhang

Publication date: 19 February 2003

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

tabu searchsatisfiability problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (4)

Tabu search for the real-world carpooling problem ⋮ Local Search to Approximate Max NAE-$$k$$-Sat Tightly ⋮ An effective hybrid algorithm for the problem of packing circles into a larger containing circle ⋮ Approximating Max NAE-\(k\)-SAT by anonymous local search

Uses Software

• DIMACS
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
• On \(k\)-positive satisfiability problem
• A Computing Procedure for Quantification Theory

This page was built for publication: An algorithm based on tabu search for satisfiability problem