Heuristic and exact algorithms for the simultaneous assignment problem.
Takeo YamadaYasushi NasuPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- exact algorithms
- benchmark instances
- knapsack problem
- approximation algorithms
- vehicle routing problem with time windows
- exact solution
- heuristic methods
- combinatorial optimization
- benders decomposition
- combinatorial problems
- np hard
- computational problems
- max sat
- combinatorial optimization problems
- dynamic programming
- optimal solution
- learning algorithm
- constraint programming
- objective function