Tighter Bounds on a Heuristic for a Partition Problem.
Joseph Y.-T. LeungW.-D. WeiPublished in: Inf. Process. Lett. (1995)
Keyphrases
- upper bound
- lower bound
- lower and upper bounds
- optimal cost
- upper and lower bounds
- linear programming relaxation
- optimal solution
- search algorithm
- heuristic solution
- tabu search
- branch and bound
- vc dimension
- branch and bound search
- beam search
- image segmentation
- tight bounds
- depth first search
- worst case analysis
- combinatorial optimization
- simulated annealing
- worst case
- dynamic programming
- branch and bound algorithm
- lagrangian relaxation
- search strategies
- error bounds
- greedy heuristic
- constraint satisfaction
- data sets