CSPLib

swMATH4150MaRDI QIDQ16334FDOQ16334

Author name not available (Why is that?)

Official website: http://www.csplib.org/

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

• Round robin scheduling -- a survey
• The ROOTS Constraint
• Set constraint model and automated encoding into SAT: application to the social golfer problem
• Solving real car sequencing problems with ant colony optimization
• 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
• Achieving domain consistency and counting solutions for dispersion constraints
• A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib)
• The extended global cardinality constraint: an empirical survey
• Recent Advances in Constraints
• Title not available (Why is that?)
• Principles and Practice of Constraint Programming – CP 2003
• Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
• On the separability of subproblems in Benders decompositions
• 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
• The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
• Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
• An effective greedy heuristic for the social golfer problem
• An improved SAT formulation for the social golfer problem
• Title not available (Why is that?)
• Evaluating ASP and commercial solvers on the CSPLib
• Propagation redundancy in redundant modelling
• The balanced academic curriculum problem revisited
• Solving Kirkman's schoolgirl problem in a few seconds
• 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
• The design of the zinc modelling language
• Large neighborhood improvements for solving car sequencing problems
• Interval-valued soft constraint problems
• CLAIRE
• EasyLocal++
• Title not available (Why is that?)
• Computational Methods in Systems Biology
• ChainSAT
• G12
• Sugar
• Kangaroo
• FOOL
• Generalised arc consistency for the AllDifferent constraint: an empirical survey
• A greedy algorithm for the social golfer and the Oberwolfach problem
• MDDs are efficient modeling tools: an application to some statistical constraints
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• SNARK
• ILOG SCHEDULE
• Localizer
• OPL
• ESRA
• Advanced constraint propagation for the combined car sequencing and level scheduling problem
• SAT and hybrid models of the car sequencing problem
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• LocalSolver 1.x: A black-box local-search solver for 0-1 programming
• Automatically improving constraint models in Savile Row
• Multiset variable representations and constraint propagation
• The generalized balanced academic curriculum problem with heterogeneous classes
• Cardinal: a finite sets constraint solver
• Review and comparison of three methods for the solution of the car sequencing problem
• New filtering algorithms for combinations of among constraints
• Two local search approaches for solving real-life car sequencing problems
• Parameterized complexity results in symmetry breaking
• Explorative anytime local search for distributed constraint optimization
• Distributed constraint satisfaction with partially known constraints
• Min-domain retroactive ordering for asynchronous backtracking
• Constraint acquisition
• Principles and Practice of Constraint Programming – CP 2004
• Construction of balanced sports schedules using partitions into subleagues
• Using solution properties within an enumerative search to solve a sports league scheduling problem
• Dealing with satisfiability and \(n\)-ary CSPs in a logical framework
• Propagation algorithms for lexicographic ordering constraints
• Principles and Practice of Constraint Programming – CP 2004
• An optimal arc consistency algorithm for a particular case of sequence constraint
• Using computational singular perturbation as a diagnostic tool in ODE and DAE systems: a case study in heterogeneous catalysis
• Scheduling reach mahjong tournaments using pseudoboolean constraints
• On implementing symmetry detection
• CP with ACO
• Design and implementation of bounded-length sequence variables
• Debugging unsatisfiable constraint models
• Propagation engine prototyping with a domain specific language
• Multicriteria models for planning power-networking events
• Parallel constraint-based local search on the Cell/BE multicore architecture
• Symmetries of symmetry breaking constraints
• The power of propagation: when GAC is enough
• Scheduling social tournaments locally
• Towards breaking more composition symmetries in partial symmetry breaking
• View-based propagation of decomposable constraints
• An analysis of empirical testing for modal decision procedures
• Recovery management for a dial-a-ride system with real-time disruptions
• Why CP portfolio solvers are (under)utilized? Issues and challenges
• A Lagrangian-ACO matheuristic for car sequencing
• \textsc{Conjure}: automatic generation of constraint models from problem specifications
• Design and implementation of a tracer driver: Easy and efficient dynamic analyses of constraint logic programs
• A method for detecting symmetries in constraint models and its generalisation
• Large-scale parallelism for constraint-based local search: the costas array case study
• Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems
• Transparent parallelization of constraint programming
• Symmetry-breaking answer set solving
• Lightweight dynamic symmetry breaking

This page was built for software: CSPLib