A Quantitative Evaluation of Limited-Memory Branch-and-Bound Algorithms.
Nihar R. MahapatraDouglas E. CovelliYuval BeresPublished in: IC-AI (1999)
Keyphrases
- quantitative evaluation
- limited memory
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- memory space
- ground truth
- influence diagrams
- np hard
- optimal solution
- data streams
- haplotype inference
- sliding window
- combinatorial optimization
- set covering problem
- quasi newton method
- qualitative evaluation
- decision problems
- real time
- quality assessment
- boolean satisfiability
- special case
- finding an optimal solution
- entropy minimization
- linear programming
- decision making