Skip to main content
SpringerLink
Log in

A Kernighan-Lin inspired algorithm for MAX-SAT

  • Letter
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

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

    Article  Google Scholar 

  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. 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

Authors and Affiliations

  1. Department of Maritime Innovation and Technology, Institute of Micro-Systems, University of South-Eastern Norway, Notodden, Borre, 3184, Norway

    Noureddine Bouhmala

Authors
  1. Noureddine Bouhmala
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Noureddine Bouhmala.

Rights and permissions

Reprints and permissions

About this article

Check for updates. 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

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-018-9786-2

Search

Navigation