scientific article; zbMATH DE number 1322793
From MaRDI portal
Publication:4253835
Recommendations
- Constraint Satisfaction
- A synthesis of constraint satisfaction and constraint solving
- Solving quantified constraint satisfaction problems
- scientific article; zbMATH DE number 1234562
- Constraint satisfaction problems: Algorithms and applications
- Artificial Intelligence: Methodology, Systems, and Applications
- Representing constraint satisfaction problems in answer set programming
- Constraint satisfaction -- algorithms and complexity analysis
- Constraint satisfaction problems: complexity and algorithms
- The Structure of Tractable Constraint Satisfaction Problems
Cited in
(13)- Reduction operations in fuzzy or valued constraint satisfaction
- On-line resources allocation for ATM networks with rerouting
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems
- Semiring-Based Soft Constraints
- A survey of constraint-based programming paradigms
- The complexity of conservative valued CSPs
- Discrete convexity and polynomial solvability in minimum 0-extension problems
- Classes of submodular constraints expressible by graph cuts
- Hybrid tractability of valued constraint problems
- Conditional lexicographic orders in constraint satisfaction problems
- Combining VNS with constraint programming for solving anytime optimization problems
- The expressive power of binary submodular functions
- A note on some collapse results of valued constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4253835)
