An algorithm for a separable integer programming problem with cumulatively bounded variables.
Martin E. DyerJohn WalkerPublished in: Discret. Appl. Math. (1987)
Keyphrases
- integer programming
- np hard
- search space
- computational complexity
- dynamic programming
- objective function
- learning algorithm
- optimal solution
- cutting plane algorithm
- benchmark problems
- vehicle routing problem with time windows
- dantzig wolfe decomposition
- max flow
- cutting plane
- network flow
- heuristic methods
- combinatorial optimization
- optimization algorithm
- linear programming