A branch and bound algorithm for numerical Max-CSP
From MaRDI portal
(Redirected from Publication:968350)
Recommendations
Cites work
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 804614 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Applying interval arithmetic to real, integer, and boolean constraints
- Consistency in networks of relations
- Estimation theory for nonlinear models and set membership uncertainty
- Global optimization by continuous grasp
- Guaranteed robust nonlinear minimax estimation
- Interval Methods for Systems of Equations
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Solving Max-SAT as weighted CSP
Cited in
(5)- scientific article; zbMATH DE number 2043437 (Why is no real title available?)
- Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- Genetic based discrete particle swarm optimization for elderly day care center timetabling
- Recent Advances in Constraints
This page was built for publication: A branch and bound algorithm for numerical Max-CSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968350)