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

@inproceedings{Wah1996ADL,
  title={A discrete Lagrangian-based global-search method for solving satisfiability problems},
  author={B. Wah and Yi Shang},
  booktitle={Satisfiability Problem: Theory and Applications},
  year={1996}
}
  • B. Wah, Yi Shang
  • Published in
    Satisfiability Problem…
    1996
  • Computer Science
Hardware Acceleration of EDA Algorithms
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
  • P. Mills, E. Tsang
  • Mathematics, Computer Science
  • Journal of Automated Reasoning
  • 2004
Applying local search to temporal reasoning
Extensions to Guided Local Search
OPTIMAL ANYTIME SEARCH FOR CONSTRAINED NONLINEAR PROGRAMMING
A Lagrangian reconstruction of GENET
Lagrangian Constrained Community Detection
Local search methods for constraint problems
Aggregating local behaviors based upon a discrete Lagrange multiplier method
  • Yi Tang, Jiming Liu, X. Jin
  • Computer Science
  • Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).
  • 2004
Augmenting Local Search for Satisfiability
...
1
2
3
4
5
...