Gecode is a toolkit for developing constraint-based systems and applications. Gecode provides a constraint solver with state-of-the-art performance while being modular and extensible. Gecode is: open. Gecode is radically open for programming: it can be easily interfaced to other systems. It supports the programming of new constraints, branching strategies, and search engines. New variable domains can be programmed at the same level of efficiency as the variables that come predefined with Gecode. comprehensive. Gecode has a comprehensive set of features: constraints over integers, Booleans, sets, and floats (it implements more than 70 constraints from the Global Constraint Catalog and many more on top); C++ modeling layer; advanced branching heuristics (accumulated failure count, activity); many search engines (parallel, interactive graphical, restarts); automatic symmetry breaking (LDSB); MiniZinc support; and many more. efficient Gecode offers excellent performance with respect to both runtime and memory usage. It won all gold medals in all categories at the MiniZinc Challenges from 2008 to 2012: 2012, 2011, 2010, 2009, and 2008. documented Gecode comes with both complete tutorial (more than 500 pages) and complete reference documentation that allows users to focus on different modeling and programming tasks with Gecode. free Gecode is distributed under the MIT license and is listed as free software by the FSF. All of its parts including reference documentation, implementations of global constraints, and examples are available as source code for download. portable Gecode is implemented in C++ that carefully follows the C++ standard. It can be compiled with modern C++ compilers and runs on a wide range of machines (including 64bit machines). parallel Gecode complies with reality in that it exploits the multiple cores of today’s commodity hardware for parallel search, giving an already efficient base system an additional edge. tested Gecode uses a test suite with almost 50000 different test cases reaching a test coverage close to 100%.

References in zbMATH (referenced in 36 articles )

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

1 2 next

  1. Cire, Andre A.; Hooker, John N.; Yunes, Tallys: Modeling with metaconstraints and semantic typing of variables (2016)
  2. Di Gaspero, Luca; Rendl, Andrea; Urli, Tommaso: Balancing bike sharing systems with constraint programming (2016)
  3. Shishmarev, Maxim; Mears, Christopher; Tack, Guido; Garcia de la Banda, Maria: Visual search tree profiling (2016)
  4. Björdal, Gustav; Monette, Jean-Noël; Flener, Pierre; Pearson, Justin: A constraint-based local search backend for MiniZinc (2015)
  5. Mittelmann, Hans D.; Salvagnin, Domenico: On solving a hard quadratic 3-dimensional assignment problem (2015)
  6. Davies, Jessica; Katsirelos, George; Narodytska, Nina; Walsh, Toby; Xia, Lirong: Complexity of and algorithms for the manipulation of Borda, Nanson’s and Baldwin’s voting rules (2014)
  7. Duchier, Denys; Dao, Thi-Bich-Hanh; Parmentier, Yannick: Model-theory and implementation of property grammars with features (2014)
  8. Fischetti, Matteo; Monaci, Michele; Salvagnin, Domenico: Self-splitting of workload in parallel computation (2014)
  9. Francis, Kathryn Glenn; Stuckey, Peter J.: Explaining circuit propagation (2014)
  10. Hurley, Barry; Kotthoff, Lars; Malitsky, Yuri; O’Sullivan, Barry: Proteus: a hierarchical portfolio of solvers and transformations (2014)
  11. Mears, Christopher; de la Banda, Maria Garcia; Demoen, Bart; Wallace, Mark: Lightweight dynamic symmetry breaking (2014)
  12. Prud’homme, Charles; Lorca, Xavier; Douence, Rémi; Jussien, Narendra: Propagation engine prototyping with a domain specific language (2014)
  13. Schrijvers, Tom; Demoen, Bart; Triska, Markus; Desouter, Benoit: Tor: modular search with hookable disjunction (2014)
  14. Brandt, Felix; Bauer, Reinhard; Völker, Markus; Cardeneo, Andreas: A constraint programming-based approach to a large-scale energy management problem with varied constraints (2013)
  15. Correia, Marco; Barahona, Pedro: View-based propagation of decomposable constraints (2013)
  16. Gualandi, Stefano; Malucelli, Federico: Constraint programming-based column generation (2013)
  17. Kameugne, Roger; Fotso, Laure Pauline: A cumulative not-first/not-last filtering algorithm in $O(n^2 \log(n))$ (2013)
  18. Law, Y.C.; Lee, J.H.M.; Walsh, T.; Woo, M.H.C.: Multiset variable representations and constraint propagation (2013)
  19. Salvagnin, Domenico: Orbital shrinking: a new tool for hybrid MIP/CP methods (2013)
  20. Schrijvers, Tom; Tack, Guido; Wuille, Pieter; Samulowitz, Horst; Stuckey, Peter J.: Search combinators (2013)

1 2 next

Further publications can be found at: