Lower bounds and heuristic algorithms for the k.
Mauro Dell'AmicoManuel IoriSilvano MartelloMichele MonaciPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- branch and bound
- np hard
- lower and upper bounds
- lower bounding
- worst case
- optimal solution
- upper and lower bounds
- randomly generated problems
- lagrangian relaxation
- quadratic assignment problem
- sample complexity
- running times
- set of randomly generated instances
- optimal cost
- vc dimension
- linear programming