Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid.
Jean FonluptAlexandre SkodaPublished in: Bonn Workshop of Combinatorial Optimization (2008)
Keyphrases
- strongly polynomial
- computational complexity
- k means
- minimum cost flow
- preprocessing
- detection algorithm
- objective function
- worst case
- linear programming
- dynamic programming
- reinforcement learning
- neural network
- segmentation algorithm
- optimization algorithm
- np hard
- probabilistic model
- metaheuristic
- computational efficiency
- linear program
- solution quality
- graph structure
- optimal solution