CSPLib
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Propagation algorithms for lexicographic ordering constraints
- Set constraint model and automated encoding into SAT: application to the social golfer problem
- Round robin scheduling -- a survey
- Principles and Practice of Constraint Programming – CP 2004
- The ROOTS Constraint
- An optimal arc consistency algorithm for a particular case of sequence constraint
- Solving real car sequencing problems with ant colony optimization
- Using computational singular perturbation as a diagnostic tool in ODE and DAE systems: a case study in heterogeneous catalysis
- Removing propagation redundant constraints in redundant modeling
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- The extended global cardinality constraint: an empirical survey
- Achieving domain consistency and counting solutions for dispersion constraints
- A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib)
- Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
- Recent Advances in Constraints
- Scheduling reach mahjong tournaments using pseudoboolean constraints
- scientific article; zbMATH DE number 2080317 (Why is no real title available?)
- On the separability of subproblems in Benders decompositions
- On implementing symmetry detection
- Principles and Practice of Constraint Programming – CP 2003
- Reformulation of global constraints based on constraints checkers
- A GRASP approach for the extended car sequencing problem
- Hybrid search for minimal perturbation in dynamic CSPs
- Design and implementation of bounded-length sequence variables
- Debugging unsatisfiable constraint models
- CP with ACO
- Propagation engine prototyping with a domain specific language
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
- Multicriteria models for planning power-networking events
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
- Parallel constraint-based local search on the Cell/BE multicore architecture
- Symmetries of symmetry breaking constraints
- The power of propagation: when GAC is enough
- An effective greedy heuristic for the social golfer problem
- An improved SAT formulation for the social golfer problem
- Evaluating ASP and commercial solvers on the CSPLib
- The balanced academic curriculum problem revisited
- scientific article; zbMATH DE number 2243353 (Why is no real title available?)
- Solving Kirkman's schoolgirl problem in a few seconds
- Propagation redundancy in redundant modelling
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- A translational approach to constraint answer set solving
- Redundant modeling in permutation weighted constraint satisfaction problems
- Towards breaking more composition symmetries in partial symmetry breaking
- View-based propagation of decomposable constraints
- Scheduling social tournaments locally
- The design of the zinc modelling language
- Large neighborhood improvements for solving car sequencing problems
- Recovery management for a dial-a-ride system with real-time disruptions
- CMBSlib
- iOpt
- LSSPER
- CLAIRE
- COMET
- BACP
- EasyLocal++
- LocalSolver
- WSAT(OIP)
- Choco
- Gecode
- MiniZinc
- Cadmium
- Prolog
- I-SATCHMO
- Cardinal
- CaSPER
- SLIDE
- ChainSAT
- Cellerator
- OscaR
- G12
- MINION
- Sugar
- ModLeanTAP
- SICStus
- Grid BnB
- Sparrow2011
- Kangaroo
- SMTtoTPTP
- FOOL
- OR-tools
- An analysis of empirical testing for modal decision procedures
- SNARK
- HAS-QAP
- ILOG SCHEDULE
- Localizer
- OPL
- ESRA
- MiniSearch
- DisChoco
- CHUFFED
- Essence
- meSAT
- Hopcroft-Karp
- FaCiLe
- HIBISCUS
- SensorDCSP
- Mistral
- sunny-cp
- Interval-valued soft constraint problems
This page was built for software: CSPLib
