Localizer

Localizer. Local search is a traditional technique to solve combinatorial search problems which has raised much interest in recent years. The design and implementation of local search algorithms is not an easy task in general and may require considerable experimentation and programming effort. However, contrary to global search, little support is available to assist the design and implementation of local search algorithms. This paper describes the design and implementation of Localizer, a modeling language for implementing local search algorithms. Localizer makes it possible to express local search algorithms in a notation close to their informal descriptions in scientific papers. Experimental results on Boolean satisfiability graph coloring, graph partitioning, and job-shop scheduling show the feasibility of the approach.


References in zbMATH (referenced in 19 articles , 1 standard article )

Showing results 1 to 19 of 19.
Sorted by year (citations)

  1. Umetani, Shunji: Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (2017)
  2. Ciancia, Vincenzo; Latella, Diego; Loreti, Michele; Massink, Mieke: Model checking spatial logics for closure spaces (2016)
  3. Benoist, Thierry; Estellon, Bertrand; Gardi, Frédéric; Megel, Romain; Nouioua, Karim: LocalSolver 1.x: A black-box local-search solver for 0-1 programming (2011)
  4. Milano, Michela; Wallace, Mark: Integrating operations research in constraint programming (2010)
  5. Frisch, Alan M.; Harvey, Warwick; Jefferson, Chris; Martínez-Hernández, Bernadette; Miguel, Ian: Essence: A constraint language for specifying combinatorial problems (2008)
  6. Ågren, Magnus; Flener, Pierre; Pearson, Justin: Generic incremental algorithms for local search (2007)
  7. de Givry, Simon; Jeannin, Laurent: A unified framework for partial and hybrid search methods in constraint programming (2006)
  8. Milano, Michela; Wallace, Mark: Integrating operations research in constraint programming (2006)
  9. Van Hentenryck, Pascal; Michel, Laurent: Differentiable invariants (2006)
  10. Katriel, Irit; Michel, Laurent; Van Hentenryck, Pascal: Maintaining longest paths incrementally (2005)
  11. Van Hentenryck, Pascal; Michel, Laurent: Control abstractions for local search (2005)
  12. Van Hentenryck, Pascal; Michel, Laurent; Liu, Liyuan: Contraint-based combinators for local search (2005)
  13. Van Hentenryck, Pascal; Michel, Laurent: Scheduling abstractions for local search (2004)
  14. Van Hentenryck, Pascal; Michel, Laurent; Liu, Liyuan: Constraint-based combinators for local search (2004)
  15. Michel, Laurent; Van Hentenryck, Pascal: Maintaining longest paths incrementally (2003)
  16. Michel, Laurent; Van Hentenryck, Pascal: Localizer (2000)
  17. Schimpf, Joachim; Wallace, Mark: Finding the right hybrid algorithm -- a combinatorial meta-problem (2000)
  18. Michel, Laurent; Van Hentenryck, Pascal: LOCALIZER: a modeling language for local search. (1999)
  19. van Hentenryck, Pascal: LOCALIZER: A modeling language for local search (1999)