Gecode

swMATH6272MaRDI QIDQ18403FDOQ18403

Author name not available (Why is that?)

Cited In (81)

• Constraint programming for dynamic symbolic execution of JavaScript
• Generating compound moves in local search by hybridisation with complete search
• \textsc{Tor}: modular search with hookable disjunction
• Modular Constraint Solver Cooperation via Abstract Interpretation
• Propagation engine prototyping with a domain specific language
• Modeling Block Structured Project Scheduling with Resource Constraints
• Graph matching problems and the NP-hardness of sortedness constraints
• Block structured scheduling using constraint logic programming
• Modeling with metaconstraints and semantic typing of variables
• \textsc{Conjure}: automatic generation of constraint models from problem specifications
• A parallel algorithm for GAC filtering of the Alldifferent constraint
• An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
• Applying Constraint Logic Programming to SQL Test Case Generation
• Core group placement: allocation and provisioning of heterogeneous resources
• Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs
• Computing AES related-key differential characteristics with constraint programming
• Reusing CSP Propagators for QCSPs
• MiniZinc with strings
• Fleet design optimisation from historical data using constraint programming and large neighbourhood search
• Visual search tree profiling
• Balancing bike sharing systems with constraint programming
• Exact solution of graph coloring problems via constraint programming and column generation
• MiniBrass: soft constraints for MiniZinc
• View-based propagator derivation
• Dynamic Analysis of Bounds Versus Domain Propagation
• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• Physician scheduling during a pandemic
• On solving a hard quadratic 3-dimensional assignment problem
• G2C: Cryptographic Protocols from Goal-Driven Specifications
• An Introduction to Search Combinators
• Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation
• Design and implementation of bounded-length sequence variables
• Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
• Feasibility pump 2.0
• Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings
• Orbital shrinking: theory and applications
• Automatically Exploiting Subproblem Equivalence in Constraint Programming
• Towards Copeland optimization in combinatorial problems
• Short-term scheduling of production fleets in underground mines using CP-based LNS
• Optimization Bounds from the Branching Dual
• A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\)
• Exploiting subproblem dominance in constraint programming
• Constraint programming-based column generation
• View-based propagation of decomposable constraints
• SelfSplit parallelization for mixed-integer linear programming
• Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
• Deleting edges to restrict the size of an epidemic: a new application for treewidth
• A constraint-based local search backend for MiniZinc
• On the reification of global constraints
• A quadratic edge-finding filtering algorithm for cumulative resource constraints
• Contractor programming
• Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012
• Explaining circuit propagation
• Solving constraint satisfaction problems with SAT modulo theories
• Philosophy of the MiniZinc challenge
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• Propagation via lazy clause generation
• Combining tree partitioning, precedence, and incomparability constraints
• Automatically improving constraint models in Savile Row
• A constraint programming model for fast optimal stowage of container vessel bays
• Multiset variable representations and constraint propagation
• Search combinators
• Underground mine scheduling of mobile machines using constraint programming and large neighborhood search
• Constraint programming approach to a bilevel scheduling problem
• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
• Constraint programming-based column generation
• Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods
• Title not available (Why is that?)
• Designing end-to-end resource reservations in predictable distributed embedded systems
• Lightweight dynamic symmetry breaking
• A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
• Multi-language evaluation of exact solvers in graphical model discrete optimization
• Investigating constraint programming for real world industrial test laboratory scheduling
• MiningZinc: a declarative framework for constraint-based mining
• Auto-tabling for subproblem presolving in MiniZinc
• A microkernel architecture for constraint programming
• Dashed strings for string constraint solving
• SeaPearl: a constraint programming solver guided by reinforcement learning
• Ant colony optimization for path planning in search and rescue operations
• A constraint programming-based approach to a large-scale energy management problem with varied constraints
• Solving a real-life, large-scale energy management problem

This page was built for software: Gecode