POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Communications of the ACM
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hybrid cc, hybrid automata and program verification (extended abstract)
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
A fast taboo search algorithm for the job shop problem
Management Science
The OPL optimization programming language
The OPL optimization programming language
Comparing trailing and copying for constraint programming
Proceedings of the 1999 international conference on Logic programming
The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Computational Logic (TOCL)
A constraint-based architecture for local search
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Constraints
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics
Journal of Heuristics
Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family
Proceedings of the 17th International Conference on Logic Programming
Using Hybrid Concurrent Constraint Programming to Model Dynamic Biological Systems
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Search Procedures and Parallelism in Constraint Programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Localizer: a Modeling Language for Local Search
INFORMS Journal on Computing
Generating Semantic Descriptions From Drawings of Scenes With Shadows
Generating Semantic Descriptions From Drawings of Scenes With Shadows
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A simple and deterministic competitive algorithm for online facility location
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
A simple and deterministic competitive algorithm for online facility location
Information and Computation
| Hi-index | 0.00 |
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supply-chain management, and resource allocation. They often give rise to complex and intricate programs, because of their inherent computational and software complexity. There is thus a strong need for software tools which would decrease the distance between the specification and the final program.This paper contains a brief description of COMET, an object-oriented language supporting a constraint-based architecture for neighborhood search. It contrasts COMET to constraint programming languages and shows how constraint programming and COMET provides many of the same benefits for constraint satisfaction and neighborhood search respectively. In particular, COMET supports a layered architecture cleanly separating modeling and search aspects of the programs, constraints encapsulating incremental algorithms, and various control abstraction to simplify neighborhood exploration and meta-heuristics.