An upper (lower) bound for Max (Min) CSP.
Ping HuangMinghao YinPublished in: Sci. China Inf. Sci. (2014)
Keyphrases
- max min
- lower bound
- constraint satisfaction problems
- upper bound
- random instances
- np hard
- min max
- branch and bound algorithm
- finding optimal solutions
- branch and bound
- objective function
- optimal solution
- constraint programming
- constraint satisfaction
- decomposition methods
- arc consistency
- lower and upper bounds
- hill climbing
- worst case
- sufficiently accurate
- np complete
- fuzzy relation equations
- linear program
- competitive ratio
- supply chain
- scheduling problem