The following pages link to MiniZinc (Q18394):
Displaying 50 items.
- A local search framework for industrial test laboratory scheduling (Q2241157) (← links)
- Combining linear programming and automated planning to solve intermodal transportation problems (Q2253643) (← links)
- Computing AES related-key differential characteristics with constraint programming (Q2289026) (← links)
- \textsc{OptiMathSAT}: a tool for optimization modulo theories (Q2303246) (← links)
- Parallel execution of schedules with random dependency graph (Q2317877) (← links)
- The algorithm selection competitions 2015 and 2017 (Q2321293) (← links)
- Wombit: a portfolio bit-vector solver using word-level propagation (Q2323450) (← links)
- Constraint programming for dynamic symbolic execution of JavaScript (Q2327235) (← links)
- Generating compound moves in local search by hybridisation with complete search (Q2327242) (← links)
- Investigating constraint programming for real world industrial test laboratory scheduling (Q2327261) (← links)
- Modelling and solving the minimum shift design problem (Q2327269) (← links)
- MiniBrass: soft constraints for MiniZinc (Q2331099) (← links)
- From MDD to BDD and arc consistency (Q2331100) (← links)
- Compiling CP subproblems to MDDs and d-DNNFs (Q2331104) (← links)
- Explaining circuit propagation (Q2342589) (← links)
- Propagation engine prototyping with a domain specific language (Q2342591) (← links)
- meSAT: multiple encodings of CSP to SAT (Q2342599) (← links)
- Symmetries, almost symmetries, and lazy clause generation (Q2342601) (← links)
- Dominance breaking constraints (Q2342647) (← links)
- A method for detecting symmetries in constraint models and its generalisation (Q2342650) (← links)
- View-based propagation of decomposable constraints (Q2348543) (← links)
- Feature-based tuning of single-stage simulated annealing for examination timetabling (Q2398423) (← links)
- Multi-language evaluation of exact solvers in graphical model discrete optimization (Q2398440) (← links)
- Graph matching problems and the NP-hardness of sortedness constraints (Q2402671) (← links)
- A decision procedure for restricted intensional sets (Q2405250) (← links)
- CP methods for scheduling and routing with~time-dependent task costs (Q2513747) (← links)
- Automated reasoning with restricted intensional sets (Q2666960) (← links)
- Exact stochastic constraint optimisation with applications in network analysis (Q2667834) (← links)
- An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning (Q2672113) (← links)
- Detecting Semantic Groups in MIP Models (Q2815122) (← links)
- Writing Declarative Specifications for Clauses (Q2835876) (← links)
- An Introduction to Search Combinators (Q2848892) (← links)
- Local Consistency and SAT-Solvers (Q2887073) (← links)
- ECL<sup>i</sup>PS<sup>e</sup> – From LP to CLP (Q2893096) (← links)
- SUNNY: a Lazy Portfolio Approach for Constraint Solving (Q2931261) (← links)
- LoCo—A Logic for Configuration Problems (Q2946729) (← links)
- URSA: A System for Uniform Reduction to SAT (Q3166220) (← links)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- Automatic Minimal-Height Table Layout (Q3458745) (← links)
- Automatically Exploiting Subproblem Equivalence in Constraint Programming (Q3569921) (← links)
- Preface (Q4593090) (← links)
- SUNNY-CP and the MiniZinc challenge (Q4603429) (← links)
- MiniZinc with Functions (Q4922917) (← links)
- A System for Solving Constraint Satisfaction Problems with SMT (Q4930597) (← links)
- (Q5020564) (← links)
- (Q5020594) (← links)
- MathOptInterface: A Data Structure for Mathematical Optimization Problems (Q5085984) (← links)
- A General Branch-and-Cut Framework for Rotating Workforce Scheduling (Q5087722) (← links)
- (Q5087786) (← links)
- Incremental Answer Set Programming with Overgrounding (Q5108513) (← links)
