swMATH ID: 2661
Software Authors: Laburthe, Francois; Caseau, Yves
Description: Constraint Programming is recognized as an efficient technique for solving hard combinatorial optimization problems. However, it is best used in conjunction with other optimization paradigms such as local search, yielding hybrid algorithms with constraints. Such combinations lack a language supporting an elegant description and retaining the original declarativity of Constraint Logic Programming. We propose a language, SALSA, dedicated to specifying (local, global or hybrid) search algorithms. We illustrate its use on a few examples from combinatorial optimization for which we specify complex optimization procedures with a few simple lines of code of high abstraction level. We report preliminary experiments showing that such a language can be implemented on top of CP systems, yielding a powerful environment for combinatorial optimization.
Homepage: http://www.springerlink.com/content/m5h5421kt131225q/
Programming Languages: None
Operating Systems: None
Dependencies: None
Keywords: search; hybrid algorithms; constraint systems
Related Software: COMET; Localizer; Oz; CPLEX; OPL; CLAIRE; EasyLocal++; Choco; CHIP; Localizer++; Numerica; Gecode; MiniZinc; SICStus; Zinc; ToOLS; AMPL; bc-opt; Concorde; ABACUS
Referenced in: 30 Publications

Standard Articles

1 Publication describing the Software, including 1 Publication in zbMATH Year
SALSA: a language for search algorithms. Zbl 1020.68028
Laburthe, François; Caseau, Yves

Referencing Publications by Year