) algorithm for the 1-maximin problem on a network". Computers and Operations Research 26 (1999) 849-869.
Arie TamirPublished in: Comput. Oper. Res. (2001)
Keyphrases
- dynamic programming
- computational cost
- experimental evaluation
- computational complexity
- times faster
- significant improvement
- learning algorithm
- high accuracy
- np hard
- detection algorithm
- optimal solution
- optimization algorithm
- simulated annealing
- computationally efficient
- expectation maximization
- improved algorithm
- theoretical analysis
- preprocessing
- k means
- particle swarm optimization
- cost function
- linear programming
- objective function
- worst case
- tree structure
- neural network
- recognition algorithm
- network flow