MiniZinc

swMATH6261MaRDI QIDQ18394FDOQ18394

Author name not available (Why is that?)

Described by source

• MiniZinc with strings
• Philosophy of the MiniZinc challenge

Cited In (only showing first 100 items - show all)

• A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
• Set constraint model and automated encoding into SAT: application to the social golfer problem
• Abstract simulation of reaction networks via Boolean networks
• Computing AES related-key differential characteristics with constraint programming
• \textsc{OptiMathSAT}: a tool for optimization modulo theories
• MiniBrass: soft constraints for MiniZinc
• meSAT: multiple encodings of CSP to SAT
• \(\text{ECL}^{\text{i}}\text{PS}^{\text{e}}\) -- from LP to CLP
• Using constraint programming for solving RCPSP/MAX-cal
• Wombit: a portfolio bit-vector solver using word-level propagation
• Constraint programming and operations research
• Exact stochastic constraint optimisation with applications in network analysis
• Branch-and-cut-and-price for multi-agent path finding
• Progress towards the Holy Grail
• ASlib: a benchmark library for algorithm selection
• An Introduction to Search Combinators
• SUNNY: a Lazy Portfolio Approach for Constraint Solving
• Design and implementation of bounded-length sequence variables
• Debugging unsatisfiable constraint models
• Explanation-based weighted degree
• Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings
• Automatically Exploiting Subproblem Equivalence in 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
• Communication protocols for options and results in a distributed optimization environment
• Feature-based tuning of single-stage simulated annealing for examination timetabling
• A complete solution to the maximum density still life problem
• Scenario-based learning for stochastic combinatorial optimisation
• Towards Copeland optimization in combinatorial problems
• Learning general constraints in CSP
• Combining linear programming and automated planning to solve intermodal transportation problems
• Investigating the existence of large sets of idempotent quasigroups via satisfiability testing
• Exploiting subproblem dominance in constraint programming
• Learning General Constraints in CSP
• View-based propagation of decomposable constraints
• Deleting edges to restrict the size of an epidemic: a new application for treewidth
• A constraint-based local search backend for MiniZinc
• A decision procedure for restricted intensional sets
• A System for Solving Constraint Satisfaction Problems with SMT
• Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
• Design and results of the Fifth Answer Set Programming Competition
• Explaining circuit propagation
• Cadmium: An Implementation of ACD Term Rewriting
• Solving constraint satisfaction problems with SAT modulo theories
• Automatically improving constraint models in Savile Row
• Search combinators
• Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
• Using dual presolving reductions to reformulate cumulative constraints
• Writing Declarative Specifications for Clauses
• Local consistency and SAT-solvers
• Representing and solving finite-domain constraint problems using systems of polynomials
• Essence: A constraint language for specifying combinatorial problems
• Multi-language evaluation of exact solvers in graphical model discrete optimization
• Investigating constraint programming for real world industrial test laboratory scheduling
• Introduction to the special issue on combining constraint solving with mining and learning
• MiningZinc: a declarative framework for constraint-based mining
• Auto-tabling for subproblem presolving in MiniZinc
• Scheduling double round-robin tournaments with divisional play using constraint programming
• A microkernel architecture for constraint programming
• Dashed strings for string constraint solving
• Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas
• A local search framework for industrial test laboratory scheduling
• MiniZinc with Functions
• URSA: A System for Uniform Reduction to SAT
• Title not available (Why is that?)
• SUNNY-CP and the MiniZinc challenge
• LoCo—A Logic for Configuration Problems
• Constraint programming for dynamic symbolic execution of JavaScript
• Generating compound moves in local search by hybridisation with complete search
• Modelling and solving the minimum shift design problem
• Logic-Based Benders Decomposition for Large-Scale Optimization
• From MDD to BDD and arc consistency
• Automatic Minimal-Height Table Layout
• Incremental Answer Set Programming with Overgrounding
• Nutmeg: a MIP and CP hybrid solver using branch-and-check
• Modelling with Option Types in MiniZinc
• Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges
• Propagation engine prototyping with a domain specific language
• Symmetries, almost symmetries, and lazy clause generation
• The algorithm selection competitions 2015 and 2017
• Graph matching problems and the NP-hardness of sortedness constraints
• Computing difference abstractions of linear equation systems
• Lifted Reasoning for Combinatorial Counting
• Title not available (Why is that?)
• Modeling the Costas array problem in QUBO for quantum annealing
• Automatic search for bit-based division property
• Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations
• Title not available (Why is that?)
• Finding the Hardest Formulas for Resolution
• \textsc{Conjure}: automatic generation of constraint models from problem specifications
• Detecting Semantic Groups in MIP Models
• MathOptInterface: A Data Structure for Mathematical Optimization Problems
• A method for detecting symmetries in constraint models and its generalisation
• Coupling different integer encodings for SAT
• Enumerated types and type extensions for MiniZinc
• Visualising Reasoning: What ATP Can Learn From CP
• Regular pattern-free coloring
• Preface
• An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
• CP methods for scheduling and routing with~time-dependent task costs

This page was built for software: MiniZinc