An Approximate Dual Projective Algorithm for Solving Assignment Problems.
K. G. RamakrishnanNarendra KarmarkarAnil P. KamathPublished in: Network Flows And Matching (1991)
Keyphrases
- dynamic programming
- experimental evaluation
- improved algorithm
- detection algorithm
- optimization algorithm
- k means
- worst case
- gradient projection
- computational cost
- np hard
- search space
- preprocessing
- computational complexity
- matching algorithm
- theoretical analysis
- simulated annealing
- times faster
- clustering method
- learning algorithm
- genetic algorithm
- exact solution
- probabilistic model
- cost function
- convex hull
- neural network
- combinatorial optimization
- significant improvement
- decision trees
- particle swarm optimization
- linear programming
- high accuracy
- data sets