Solving Linear Pseudo-Boolean Constraint Problems with Local Search

  title={Solving Linear Pseudo-Boolean Constraint Problems with Local Search},
  author={Joachim P. Walser},
Stochastic local search is one of the most successful method s for model finding in propositional satisfiability. However, many combinatorial problems have no concise propositional encoding. In this paper, we show that domain-independent local search for satisfiability (Walksat) can be generalize d to handle systems of linear pseudo-Boolean (0-1 integer) constraints, a representation that is widely used in operation s research. We introduce the algorithm W SAT (PB) and demonstrate its potential… CONTINUE READING
Highly Cited
This paper has 94 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 59 extracted citations

Pre-scheduling on the domain of integers

25th IEEE International Real-Time Systems Symposium • 2004
View 15 Excerpts
Highly Influenced

An application of the constraint programming to the design and operation of synthetic aperture radars

2012 IEEE Conference on High Performance Extreme Computing • 2012
View 1 Excerpt

Miplib 2010

Math. Program. Comput. • 2011

94 Citations

Citations per Year
Semantic Scholar estimates that this publication has 94 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 15 references

Some radar surveillance problems

P. Brand, S. Haridi, O. Olsson
Technical report, Swedish Institute of Computer Science, SICS. To appear. • 1997

Tabu search

F. Glover, M. Laguna
Reeves, C. R., ed.,Modern Heuristic Techniques for Combinatorial Problems. Halsted Press. chapter 3, 70–150. • 1993
View 2 Excerpts

Similar Papers

Loading similar papers…