A discrete Lagrangian-based global-search method for solving satisfiability problems

Benjamin Wan-Sang Wah, Yi Shang. A discrete Lagrangian-based global-search method for solving satisfiability problems. In Ding-Zhu Du, Jun Gu, Panos M. Pardalos, editors, Satisfiability Problem: Theory and Applications, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 11-13, 1996. Volume 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 365-392, DIMACS/AMS, 1996.

@inproceedings{WahS96,
  title = {A discrete Lagrangian-based global-search method for solving satisfiability problems},
  author = {Benjamin Wan-Sang Wah and Yi Shang},
  year = {1996},
  researchr = {https://researchr.org/publication/WahS96},
  cites = {0},
  citedby = {0},
  pages = {365-392},
  booktitle = {Satisfiability Problem: Theory and Applications, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 11-13, 1996},
  editor = {Ding-Zhu Du and Jun Gu and Panos M. Pardalos},
  volume = {35},
  series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  publisher = {DIMACS/AMS},
}