Gecode
| Gecode | |
|---|---|
 | |
| Original author | Christian Schulte  |
| Stable release | |
| Written in | C++ |
| Type | constraint satisfaction |
| License | MIT License (free software) |
| Website | www |
| Repository | |
Gecode (for Generic Constraint Development Environment) is a software library for solving Constraint satisfaction problems. It is programmed in C++ and distributed as free software under the permissive MIT license. Gecode has bindings for several programming languages such as Prolog, Python and Ruby, and an interface to the AMPL modeling language.
The development of Gecode has been led by Christian Schulte,[2] but has been contributed to by many other researchers and programmers, including Denys Duchier, Filip Konvicka, Gabor Szokoli, Guido Tack, Håkan Kjellerstrand, Mikael Lagerkvist, Patrick Pekczynski, Raphael Reischuk, and Tias Guns.[3]
The first release of Gecode was in December 2005.[4] Since then, Gecode has rapidly become prominent constraint programming systems. Contributing factors include its execution performance, extensibility, distribution as free and open-source software under a permissive licence, and implementation in a widely used programming language. In addition to its standalone use, its extensibility and licensing makes it highly suitable for use on other projects.[5] Gecode has been ported to several language, for instance, Gelisp is a wrapper of Gecode for Lisp.[6]
Notes
[edit]- ↑ "Release 6.4.0". 15 July 2026. Retrieved 16 July 2026.
- ↑ "Statement on Christian Schulte's web page, Nov 10 2009". Archived from the original on 2014-06-06. Retrieved 2014-06-04.
- ↑ Gecode Documentation list of authors, Nov 10 2009
- ↑ "Gecode: Changelog". www.gecode.dev. Retrieved 2024-06-26.
- ↑ List of projects using Gecode
- ↑ Mauricio Toro, Carlos Agon, Camilo Rueda, Gerard Assayag. "GELISP: A FRAMEWORK TO REPRESENT MUSICAL CONSTRAINT SATISFACTION PROBLEMS AND SEARCH STRATEGIES Archived 2024-10-06 at the Wayback Machine." Journal of Theoretical and Applied Information Technology 86 (2). 2016. 327-331.
References
[edit]- Speeding up constraint propagation. Christian Schulte and Peter J. Stuckey, In Wallace, 2004, pages 619–633.
- Compiling and Executing Declarative Modeling Languages to Gecode[dead link]. Raffaele Cipriano, Agostino Dovier, Jacopo Mauro. Conference: International Conference on Logic Programming/Joint International Conference and Symposium on Logic Programming - ICLP(JICSLP), pp. 744–748, 2008
- Monadic Constraint Programming with Gecode. Pieter Wuille, Tom Schrijvers. Proceedings of the 8th International Workshop on Constraint Modelling and Reformulation pages:171-185. International workshop on Constraint Modelling and Reformulation. Lisbon, 20 September 2009.
- A hybrid solver for large neighborhood search: Mixing Gecode and EasyLocal++. Raffaele Cipriano, Luca Di Gaspero, Agostino Dovier. Conference: Hybrid Metaheuristics - HM, pp. 141–155, 2009. DOI: 10.1007/978-3-642-04918-7_11
External links
[edit]- Gecode home site
- Christian Schulte Archived 2014-06-06 at the Wayback Machine, lead developer of Gecode.
- Constraint Propagation Archived 2009-04-19 at the Wayback Machine - Dissertation by Guido Tack explaining the theory and implementation of Gecode
 | This scientific software article is a stub. You can help Wikipedia by adding missing information. |
 | This computer-library-related article is a stub. You can help Wikipedia by adding missing information. |