New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling.
Francis SourdPublished in: INFORMS J. Comput. (2009)
Keyphrases
- exact algorithms
- knapsack problem
- approximation algorithms
- benchmark instances
- vehicle routing problem with time windows
- exact solution
- computational problems
- combinatorial optimization
- combinatorial optimization problems
- max sat
- benders decomposition
- combinatorial problems
- heuristic methods
- nonlinear programming
- machine learning
- greedy algorithm
- optimization problems
- dynamic programming
- cost function
- neural network