Pages that link to "Item:Q968350"
From MaRDI portal
The following pages link to A branch and bound algorithm for numerical Max-CSP (Q968350):
Displaying 4 items.
- Genetic based discrete particle swarm optimization for elderly day care center timetabling (Q342133) (← links)
- Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems (Q1304770) (← links)
- A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
- Recent Advances in Constraints (Q5899109) (← links)