A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem.
Dorit S. HochbaumPublished in: Comput. Ind. Eng. (2016)
Keyphrases
- computational complexity
- learning algorithm
- optimization algorithm
- linear complexity
- convex hull
- minimal cost
- computational cost
- dynamic programming
- np hard
- probabilistic model
- worst case
- linear programming
- globally optimal
- cost function
- detection algorithm
- matching algorithm
- convergence rate
- strongly polynomial
- primal dual
- minimum cost
- computationally tractable
- cost sensitive
- segmentation algorithm
- expectation maximization
- particle swarm optimization
- markov random field
- response time
- k means
- search space