A new approach for weighted constraint satisfaction
From MaRDI portal
(Redirected from A new approach for weighted constraint satisfaction)
Recommendations
Cited in
(11)- The \textsc{WeightedCircuitsLmax} constraint
- Semidefinite programming and constraint programming
- scientific article; zbMATH DE number 1002207 (Why is no real title available?)
- Weighting strategy for non-clausal resolution
- Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
- Computing weighted solutions in ASP: representation-based method vs. search-based method
- Randomized approximation of the constraint satisfaction problem
- scientific article; zbMATH DE number 1114005 (Why is no real title available?)
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- Weighted matching as a generic pruning technique applied to optimization constraints
- Weighted A^* search - unifying view and application
This page was built for publication: A new approach for weighted constraint satisfaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698082)