Routing in grid graphs by cutting planes.
Martin GrötschelAlexander MartinRobert WeismantelPublished in: Math. Methods Oper. Res. (1995)
Keyphrases
- cutting plane
- integer programming
- integer programming problems
- cutting plane algorithm
- lower bound
- column generation
- mixed integer
- routing protocol
- dantzig wolfe decomposition
- routing problem
- integer program
- valid inequalities
- knapsack problem
- linear programming
- ad hoc networks
- routing algorithm
- dynamic systems
- simulated annealing
- artificial bee colony algorithm
- training set
- feature space
- shortest path