Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset.
Alexander Kel'manovVladimir I. KhandeevAnna PanasenkoPublished in: AIST (2018)
Keyphrases
- exact algorithms
- exact solution
- special case
- computational problems
- nonlinear programming
- approximation algorithms
- knapsack problem
- benders decomposition
- vehicle routing problem with time windows
- combinatorial optimization problems
- benchmark instances
- heuristic methods
- combinatorial problems
- learning algorithm
- search strategies
- decision problems
- optimization problems
- np hard
- objective function