The following pages link to CSPLib (Q16334):
Displaying 50 items.
- Set constraint model and automated encoding into SAT: application to the social golfer problem (Q256655) (← links)
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework (Q438582) (← links)
- The generalized balanced academic curriculum problem with heterogeneous classes (Q475183) (← links)
- Multiset variable representations and constraint propagation (Q481702) (← links)
- Constraint acquisition (Q511791) (← links)
- The balanced academic curriculum problem revisited (Q519088) (← links)
- The extended global cardinality constraint: an empirical survey (Q543616) (← links)
- Redundant modeling in permutation weighted constraint satisfaction problems (Q606896) (← links)
- Interval-valued soft constraint problems (Q616770) (← links)
- Hybrid search for minimal perturbation in dynamic CSPs (Q647481) (← links)
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming (Q657572) (← links)
- A GRASP approach for the extended car sequencing problem (Q835577) (← links)
- Min-domain retroactive ordering for asynchronous backtracking (Q842785) (← links)
- Distributed constraint satisfaction with partially known constraints (Q842788) (← links)
- New filtering algorithms for combinations of among constraints (Q842795) (← links)
- On the separability of subproblems in Benders decompositions (Q846136) (← links)
- Reformulation of global constraints based on constraints checkers (Q850448) (← links)
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings (Q862408) (← links)
- Cardinal: a finite sets constraint solver (Q879977) (← links)
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem (Q932211) (← links)
- Two local search approaches for solving real-life car sequencing problems (Q932212) (← links)
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem (Q932219) (← links)
- Combining two pheromone structures for solving the car sequencing problem with ant colony optimization (Q932221) (← links)
- The design of the zinc modelling language (Q941812) (← links)
- Construction of balanced sports schedules using partitions into subleagues (Q943779) (← links)
- Using solution properties within an enumerative search to solve a sports league scheduling problem (Q944722) (← links)
- Multicriteria models for planning power-networking events (Q992580) (← links)
- Evaluating ASP and commercial solvers on the CSPLib (Q1020490) (← links)
- On implementing symmetry detection (Q1037637) (← links)
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG (Q1616392) (← links)
- Towards breaking more composition symmetries in partial symmetry breaking (Q1677433) (← links)
- Automatically improving constraint models in Savile Row (Q1680696) (← links)
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 (Q1694574) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- Efficient filtering for the resource-cost alldifferent constraint (Q1701236) (← links)
- An effective greedy heuristic for the social golfer problem (Q1761919) (← links)
- An improved SAT formulation for the social golfer problem (Q1761920) (← links)
- Solving Kirkman's schoolgirl problem in a few seconds (Q1774517) (← links)
- Advanced constraint propagation for the combined car sequencing and level scheduling problem (Q1782169) (← links)
- A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib) (Q1887059) (← links)
- MDDs are efficient modeling tools: an application to some statistical constraints (Q2011571) (← links)
- Design and implementation of bounded-length sequence variables (Q2011574) (← links)
- Debugging unsatisfiable constraint models (Q2011577) (← links)
- Scheduling reach mahjong tournaments using pseudoboolean constraints (Q2118316) (← links)
- \textsc{Conjure}: automatic generation of constraint models from problem specifications (Q2163883) (← links)
- Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems (Q2289022) (← links)
- Recovery management for a dial-a-ride system with real-time disruptions (Q2327632) (← links)
- An optimal arc consistency algorithm for a particular case of sequence constraint (Q2342590) (← links)
- Propagation engine prototyping with a domain specific language (Q2342591) (← links)
- Lightweight dynamic symmetry breaking (Q2342593) (← links)
