constraint-programming
Articles
- Min-conflicts algorithmSearch algorithm or heuristic method to solve constraint satisfaction problems
- Backmarking
- Test functions for optimizationFunctions used to evaluate optimization algorithms
- Local search (constraint satisfaction)
- Barrier functionContinuous function whose value increases to infinity
- AC-3 algorithmAlgorithms in constraint satisfaction
- Ordered graphGraph with a total order over its nodes
- Decomposition method (constraint satisfaction)
- Constraint learning
- Hybrid algorithm (constraint satisfaction)
- Constraint graph
- Hybrid algorithm (constraint satisfaction)
- Constraint graph
- Weighted constraint satisfaction problem
- Min-conflicts algorithmSearch algorithm or heuristic method to solve constraint satisfaction problems
- Hybrid algorithm (constraint satisfaction)
- Constraint graph
- AC-3 algorithmAlgorithms in constraint satisfaction
- AC-3 algorithmAlgorithms in constraint satisfaction
- DPLL algorithmType of search algorithm
- Constraint composite graphNode-weighted undirected graph associated with a given combinatorial optimization problem
- Backmarking
- Constraint satisfaction dual problem
- Complexity of constraint satisfaction
- Min-conflicts algorithmSearch algorithm or heuristic method to solve constraint satisfaction problems
- Backmarking
- Hybrid algorithm (constraint satisfaction)
- Constraint graph
- Ordered graphGraph with a total order over its nodes
- AC-3 algorithmAlgorithms in constraint satisfaction
- Min-conflicts algorithmSearch algorithm or heuristic method to solve constraint satisfaction problems
- Backmarking
- Constraint satisfaction problemSet of objects whose state must satisfy limits
- Constraint satisfactionProcess in artificial intelligence and operations research
- Hidden transformation
- Local consistency