MiniZinc
From MaRDI portal
Cited in
(only showing first 100 items - show all)- CsegGraph
- iOpt
- SMS++
- FinBERT
- SeaPearl
- SCIL
- NP-SPEC
- LSSPER
- SALSA
- HYPROLOG
- COMET
- CHIP
- Paradox
- Progress towards the Holy Grail
- Constraint programming and operations research
- Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings
- EasyLocal++
- CSPLib
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Automatically improving constraint models in Savile Row
- JOBSHOP
- Using constraint programming for solving RCPSP/MAX-cal
- LocalSolver
- Auto-tabling for subproblem presolving in MiniZinc
- A microkernel architecture for constraint programming
- Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas
- RPOLY
- Scheduling double round-robin tournaments with divisional play using constraint programming
- Optimal allocation of buffer times to increase train schedule robustness
- Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems
- A complete solution to the maximum density still life problem
- Investigating the existence of large sets of idempotent quasigroups via satisfiability testing
- Choco
- FlatZinc
- Gecode
- SATzilla
- JaCoP
- SPOT
- Cadmium
- wamcc
- Oz
- B-Prolog
- ProB
- clasp
- MUNCH
- CAMA
- ToulBar2
- NumberJack
- Design and implementation of bounded-length sequence variables
- Debugging unsatisfiable constraint models
- Explanation-based weighted degree
- Scenario-based learning for stochastic combinatorial optimisation
- Zinc
- Dashed strings for string constraint solving
- CaSPER
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
- Abstract simulation of reaction networks via Boolean networks
- URBiVA
- Automatic search for bit-based division property
- Branch-and-cut-and-price for multi-agent path finding
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations
- Modeling the Costas array problem in QUBO for quantum annealing
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Towards Copeland optimization in combinatorial problems
- Coupling different integer encodings for SAT
- Enumerated types and type extensions for MiniZinc
- ARXtools
- Regular pattern-free coloring
- Sugar
- HAMPI
- OscaR
- Proteus
- CSP2SAT4J
- Azucar
- G12
- MINION
- MPL
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- BWare
- Computing difference abstractions of linear equation systems
- A local search framework for industrial test laboratory scheduling
- Combining linear programming and automated planning to solve intermodal transportation problems
- Computing AES related-key differential characteristics with constraint programming
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Parallel execution of schedules with random dependency graph
- The algorithm selection competitions 2015 and 2017
- Wombit: a portfolio bit-vector solver using word-level propagation
- Constraint programming for dynamic symbolic execution of JavaScript
- Generating compound moves in local search by hybridisation with complete search
- Investigating constraint programming for real world industrial test laboratory scheduling
- Modelling and solving the minimum shift design problem
- MiniBrass: soft constraints for MiniZinc
- From MDD to BDD and arc consistency
- Compiling CP subproblems to MDDs and d-DNNFs
- Explaining circuit propagation
- Propagation engine prototyping with a domain specific language
- meSAT: multiple encodings of CSP to SAT
- Symmetries, almost symmetries, and lazy clause generation
This page was built for software: MiniZinc
