Automatically improving constraint models in Savile Row
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1975610 (Why is no real title available?)
- scientific article; zbMATH DE number 2080324 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3249566 (Why is no real title available?)
- A discrete Lagrangian-based global-search method for solving satisfiability problems
- AI 2006: Advances in artificial intelligence. 19th Australian joint conference on artificial intelligence, Hobart, Australia, December 4--8, 2006. Proceedings
- Automatically improving constraint models in Savile Row
- Cadmium: An Implementation of ACD Term Rewriting
- Compiling finite linear CSP into SAT
- Constraint Handling Rules
- Cost-based arc consistency for global cardinality constraints
- Design of financial CDO squared transactions using constraint programming
- Efficient algorithms for singleton arc consistency
- Encodings of the Sequence Constraint
- Exploiting symmetries within constraint satisfaction search
- Graph coloring inequalities from all-different systems
- Handbook of constraint programming.
- Implementing logical connectives in constraint programming
- Inprocessing rules
- MiniSat
- MiniZinc with functions
- Presolve Reductions in Mixed Integer Programming
- Principles and Practice of Constraint Programming – CP 2003
- Revisiting the Sequence Constraint
- Second-order consistencies
- Symmetry and Search in a Network Design Problem
- Symmetry breaking using stabilizers
- The extended global cardinality constraint: an empirical survey
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Towards Robust CNF Encodings of Cardinality Constraints
Cited in
(15)- Enumeration of set-theoretic solutions to the Yang-Baxter equation
- Constraint programming and operations research
- Progress towards the Holy Grail
- Learning to select SAT encodings for pseudo-Boolean and linear Integer constraints
- On the enumeration of finite 𝐿-algebras
- scientific article; zbMATH DE number 2084759 (Why is no real title available?)
- A review of literature on parallel constraint solving
- A constraint-based local search backend for MiniZinc
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Automated streamliner portfolios for constraint satisfaction problems
- Efficiently explaining CSPs with unsatisfiable subset optimization
- Automatically improving constraint models in Savile Row
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- Solving computational problems in the theory of word-representable graphs
This page was built for publication: Automatically improving constraint models in Savile Row
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680696)
