Localizer

  • Authors:
  • Laurent Michel;Pascal Van Hentenryck

  • Affiliations:
  • Brown University, Box 1910, Providence, RI 02912;Brown University, Box 1910, Providence, RI 02912

  • Venue:
  • Constraints
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Local search is a traditional technique to solve combinatorialsearch problems which has raised much interest in recent years.The design and implementation of local search algorithms is notan easy task in general and may require considerable experimentationand programming effort. However, contrary to global search, littlesupport is available to assist the design and implementationof local search algorithms. This paper describes the design andimplementation of Localizer, a modeling language forimplementing local search algorithms. Localizer makesit possible to express local search algorithms in a notationclose to their informal descriptions in scientific papers. Experimentalresults on Boolean satisfiability, graph coloring, graph partitioning,and job-shop scheduling show the feasibility of the approach.