Theoretical and Experimental Analysis of the Jurema Branch-and-Bound Method.
Felipe Martins MüllerGuilherme DheinOlinto César Bassi de AraújoPublished in: WEIT (2011)
Keyphrases
- theoretical and experimental analysis
- branch and bound method
- branch and bound
- branch and bound algorithm
- reduce the search space
- lower bound
- mixed integer programming
- optimal configuration
- feasible solution
- subband
- search algorithm
- feature vectors
- np hard
- upper bound
- tabu search
- combinatorial optimization
- linear programming
- search space
- pattern recognition