A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs.
Martin KouteckýAsaf LevinShmuel OnnPublished in: CoRR (2018)
Keyphrases
- strongly polynomial
- optimal solution
- search space
- np hard
- computational complexity
- minimum cost flow
- linear programming
- test problems
- optimization algorithm
- worst case
- objective function
- neural network
- particle swarm optimization
- np complete
- upper bound
- network flow
- integer program
- shortest path algorithm
- special case