The following pages link to Gecode (Q18403):
Displayed 50 items.
- Fleet design optimisation from historical data using constraint programming and large neighbourhood search (Q265693) (← links)
- Visual search tree profiling (Q265707) (← links)
- Balancing bike sharing systems with constraint programming (Q272022) (← links)
- Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012 (Q338855) (← links)
- Exploiting subproblem dominance in constraint programming (Q453591) (← links)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- Multiset variable representations and constraint propagation (Q481702) (← links)
- Solving constraint satisfaction problems with SAT modulo theories (Q487632) (← links)
- Search combinators (Q487659) (← links)
- MiningZinc: a declarative framework for constraint-based mining (Q511753) (← links)
- Philosophy of the MiniZinc challenge (Q606904) (← links)
- Constraint programming approach to a bilevel scheduling problem (Q647473) (← links)
- Contractor programming (Q840818) (← links)
- A constraint-based local search backend for MiniZinc (Q890003) (← links)
- Combining tree partitioning, precedence, and incomparability constraints (Q1020493) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG (Q1616392) (← 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)
- Designing end-to-end resource reservations in predictable distributed embedded systems (Q1640308) (← links)
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
- Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
- Automatically improving constraint models in Savile Row (Q1680696) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- Auto-tabling for subproblem presolving in MiniZinc (Q1701238) (← links)
- A microkernel architecture for constraint programming (Q1706769) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- A constraint programming model for fast optimal stowage of container vessel bays (Q1926732) (← links)
- Design and implementation of bounded-length sequence variables (Q2011574) (← links)
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem (Q2011610) (← links)
- Dashed strings for string constraint solving (Q2046015) (← links)
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences (Q2079273) (← links)
- Ant colony optimization for path planning in search and rescue operations (Q2083926) (← links)
- Short-term scheduling of production fleets in underground mines using CP-based LNS (Q2117237) (← links)
- SeaPearl: a constraint programming solver guided by reinforcement learning (Q2117242) (← links)
- Physician scheduling during a pandemic (Q2117251) (← links)
- \textsc{Conjure}: automatic generation of constraint models from problem specifications (Q2163883) (← links)
- Towards Copeland optimization in combinatorial problems (Q2170176) (← links)
- A parallel algorithm for GAC filtering of the Alldifferent constraint (Q2170220) (← links)
- Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs (Q2195978) (← links)
- Propagation via lazy clause generation (Q2272160) (← links)
- Computing AES related-key differential characteristics with constraint programming (Q2289026) (← links)
- Core group placement: allocation and provisioning of heterogeneous resources (Q2294073) (← 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)
- MiniBrass: soft constraints for MiniZinc (Q2331099) (← links)
- On the reification of global constraints (Q2342583) (← links)
- View-based propagator derivation (Q2342586) (← links)
- Explaining circuit propagation (Q2342589) (← links)