The following pages link to MiniZinc (Q18394):
Displaying 50 items.
- Set constraint model and automated encoding into SAT: application to the social golfer problem (Q256655) (← links)
- ASlib: a benchmark library for algorithm selection (Q286390) (← links)
- Communication protocols for options and results in a distributed optimization environment (Q298160) (← links)
- Learning general constraints in CSP (Q309921) (← links)
- Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
- Exploiting subproblem dominance in constraint programming (Q453591) (← links)
- Solving constraint satisfaction problems with SAT modulo theories (Q487632) (← links)
- Using dual presolving reductions to reformulate cumulative constraints (Q487651) (← links)
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655) (← links)
- Search combinators (Q487659) (← links)
- Introduction to the special issue on combining constraint solving with mining and learning (Q511749) (← links)
- MiningZinc: a declarative framework for constraint-based mining (Q511753) (← links)
- A constraint-based local search backend for MiniZinc (Q890003) (← links)
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- Essence: A constraint language for specifying combinatorial problems (Q941817) (← links)
- Progress towards the Holy Grail (Q1616388) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings (Q1626699) (← links)
- Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713) (← links)
- Automatically improving constraint models in Savile Row (Q1680696) (← links)
- Using constraint programming for solving RCPSP/MAX-cal (Q1699524) (← links)
- Auto-tabling for subproblem presolving in MiniZinc (Q1701238) (← links)
- A microkernel architecture for constraint programming (Q1706769) (← links)
- Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas (Q1735326) (← links)
- Scheduling double round-robin tournaments with divisional play using constraint programming (Q1751946) (← links)
- Optimal allocation of buffer times to increase train schedule robustness (Q1752165) (← links)
- Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems (Q1754108) (← links)
- A complete solution to the maximum density still life problem (Q1761276) (← links)
- Investigating the existence of large sets of idempotent quasigroups via satisfiability testing (Q1799096) (← links)
- Design and implementation of bounded-length sequence variables (Q2011574) (← links)
- Debugging unsatisfiable constraint models (Q2011577) (← links)
- Explanation-based weighted degree (Q2011586) (← links)
- Scenario-based learning for stochastic combinatorial optimisation (Q2011603) (← links)
- Dashed strings for string constraint solving (Q2046015) (← links)
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences (Q2079273) (← links)
- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl (Q2099497) (← links)
- Abstract simulation of reaction networks via Boolean networks (Q2112137) (← links)
- Automatic search for bit-based division property (Q2146095) (← links)
- Branch-and-cut-and-price for multi-agent path finding (Q2147092) (← links)
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
- Modeling the Costas array problem in QUBO for quantum annealing (Q2163794) (← links)
- \textsc{Conjure}: automatic generation of constraint models from problem specifications (Q2163883) (← links)
- Towards Copeland optimization in combinatorial problems (Q2170176) (← links)
- Coupling different integer encodings for SAT (Q2170178) (← links)
- Enumerated types and type extensions for MiniZinc (Q2170216) (← links)
- Regular pattern-free coloring (Q2172395) (← links)
- Nutmeg: a MIP and CP hybrid solver using branch-and-check (Q2226478) (← links)
- Computing difference abstractions of linear equation systems (Q2238208) (← links)
