MINION is a new constraint solver, which is very fast and scales well as problem size increases. Empirical results on standard benchmarks show orders of magnitude performance gains over state-of-the-art constraint toolkits. These gains increase with problem size --- MINION delivers scalable constraint solving. MINION is a general-purpose constraint solver, with an expressive input language based on the common constraint modelling device of matrix models. Focussing on matrix models supports a lean, highly-optimised implementation. This contrasts with current constraint toolkits, which, in order to provide ever more modelling and solving options, have become progressively more complex at the cost of both performance and usability. MINION is a black box from the user point of view, deliberately providing few options. This, combined with its raw speed, makes MINION a substantial step towards Puget’s `Model and Run’ constraint solving paradigm.

References in zbMATH (referenced in 50 articles )

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

1 2 3 next

  1. Campercholi, Miguel; Tellechea, Mauricio; Ventura, Pablo: Deciding quantifier-free definability in finite algebraic structures (2020)
  2. Falcón, Raúl M.; Stones, Rebecca J.: Enumerating partial Latin rectangles (2020)
  3. Omrani, Mohamed Amine; Naanaa, Wady: Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs (2020)
  4. Akgün, Özgür; Gent, Ian; Kitaev, Sergey; Zantema, Hans: Solving computational problems in the theory of word-representable graphs (2019)
  5. Álvarez, V.; Armario, J. A.; Falcón, R. M.; Frau, M. D.; Gudiel, F.; Güemes, M. B.; Osuna, A.: Generating binary partial Hadamard matrices (2019)
  6. Malandro, Martin E.: Enumeration of finite inverse semigroups (2019)
  7. Alvarez, V.; Armario, J. A.; Falcón, R. M.; Frau, M. D.; Gudiel, F.; Güemes, M. B.; Osuna, A.: A mixed heuristic for generating cocyclic Hadamard matrices (2018)
  8. Bamberg, John; Bishnoi, Anurag; Royle, Gordon F.: On regular induced subgraphs of generalized polygons (2018)
  9. Cameron, Peter J.; Gadouleau, Maximilien; Mitchell, James D.; Peresse, Yann: Chains of subsemigroups (2017)
  10. Kimmerle, W.; Konovalov, A.: On the Gruenberg-Kegel graph of integral group rings of finite groups (2017)
  11. Michel, L.; Van Hentenryck, P.: A microkernel architecture for constraint programming (2017)
  12. Nightingale, Peter; Akgün, Özgür; Gent, Ian P.; Jefferson, Christopher; Miguel, Ian; Spracklen, Patrick: Automatically improving constraint models in Savile Row (2017)
  13. Abdesselam, Abdelmalek; Ikenmeyer, Christian; Royle, Gordon: 16,051 formulas for Ottaviani’s invariant of cubic threefolds (2016)
  14. Araújo, João; Bentz, Wolfram; Cameron, Peter J.; Royle, Gordon; Schaefer, Artur: Primitive groups, graph endomorphisms and synchronization (2016)
  15. Banković, Milan: Extending SMT solvers with support for finite domain \textttalldifferentconstraint (2016)
  16. Bischl, Bernd; Kerschke, Pascal; Kotthoff, Lars; Lindauer, Marius; Malitsky, Yuri; Fréchette, Alexandre; Hoos, Holger; Hutter, Frank; Leyton-Brown, Kevin; Tierney, Kevin; Vanschoren, Joaquin: ASlib: a benchmark library for algorithm selection (2016)
  17. Martis, Michael; Bamberg, John; Morris, Sylvia: An enumeration of certain projective ternary two-weight codes (2016)
  18. Thorstensen, Evgenij: Structural decompositions for problems with global constraints (2016)
  19. Gent, Ian; Kitaev, Sergey; Konovalov, Alexander; Linton, Steve; Nightingale, Peter: (S)-crucial and bicrucial permutations with respect to squares (2015)
  20. McKay, Brendan D.; Wanless, Ian M.; Zhang, Xiande: The order of automorphisms of quasigroups (2015)

1 2 3 next

Further publications can be found at: