Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

A Kernighan-Lin inspired algorithm for MAX-SAT

This is a preview of subscription content, log in to check access.

References

  1. 1

    Kernighan B W, Lin S. An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J, 1970, 49: 291–307

  2. 2

    Smyth K, Hoos H H, Stützle T. Iterated robust tabu search for MAX-SAT. In: Proceedings of the 16th Canadian Society for Computational Studies of Intelligence Conference on Advances in Artificial Intelligence, Halifax, 2003. 129–144

  3. 3

    Tompkins A D, Hoos H H. UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In: Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing, Vancouver, 2004. 306–320

Download references

Author information

Correspondence to Noureddine Bouhmala.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Bouhmala, N. A Kernighan-Lin inspired algorithm for MAX-SAT. Sci. China Inf. Sci. 62, 219106 (2019). https://doi.org/10.1007/s11432-018-9786-2

Download citation