The 3x+1 problem: new lower bounds on nontrivial cycle lengths.
Shalom EliahouPublished in: Discret. Math. (1993)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- lower and upper bounds
- np hard
- worst case
- linear programming relaxation
- quadratic assignment problem
- optimal solution
- lower bounding
- lagrangian relaxation
- upper and lower bounds
- randomly generated problems
- concept class
- vc dimension
- np complete
- optimal cost
- online algorithms
- running times
- learning theory
- genetic algorithm
- computational complexity
- similarity measure