Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the vehicle routing problem
Management Science
Encapsulated search for higher-order concurrent constraint programming
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Search and imperative programming
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
OPL Script: Composing and Controlling Models
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
High-level nondeterministic abstractions in c++
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Nondeterministic control for hybrid search
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
Constraint Programming is a technique of choice 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.