Exact algorithms for polynomial real root approximation using continued fractions.
Alkiviadis G. AkritasH. Ng KingPublished in: Computing (1983)
Keyphrases
- exact algorithms
- approximation algorithms
- knapsack problem
- vehicle routing problem with time windows
- benders decomposition
- benchmark instances
- exact solution
- combinatorial optimization
- randomized approximation
- np hard
- combinatorial optimization problems
- heuristic methods
- orders of magnitude
- max sat
- special case
- computational problems
- lower bound
- low degree
- learning algorithm
- information retrieval