Localization of the optimal solution and a posteriori bounds for aggregation.
Igor S. LitvinchevSocorro RangelPublished in: Comput. Oper. Res. (1999)
Keyphrases
- optimal solution
- lower bound
- upper bound
- branch and bound
- objective function
- np hard
- branch and bound algorithm
- number of iterations required
- iterative procedure
- upper and lower bounds
- feasible solution
- linear program
- solution quality
- rank aggregation
- knapsack problem
- localization algorithm
- error bounds
- neural network
- data aggregation
- average case
- metaheuristic
- localization error
- optic disc
- search space
- vc dimension
- lower and upper bounds
- global optimum
- worst case
- accurate localization
- linear programming
- object localization
- special case
- position information
- greedy heuristic
- locally optimal
- column generation
- tight bounds