Lower bounds for the axial three-index assignment problem.
Bum-Jin KimWilliam L. HightowerPeter M. HahnYi-Rong ZhuLu SunPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- lower bound
- np hard
- upper bound
- worst case
- objective function
- branch and bound
- branch and bound algorithm
- database
- optimal solution
- lower bounding
- multi dimensional
- vc dimension
- index structure
- optimal cost
- upper and lower bounds
- lower and upper bounds
- structural similarity
- online algorithms
- high dimensional
- database systems