A Branch & Cut algorithm for a four-index assignment problem.
Gautam AppaDimitrios MagosIoannis MourtosPublished in: J. Oper. Res. Soc. (2004)
Keyphrases
- np hard
- computational complexity
- cost function
- learning algorithm
- recognition algorithm
- optimization algorithm
- matching algorithm
- detection algorithm
- similarity measure
- optimal solution
- preprocessing
- dynamic programming
- data sets
- times faster
- high accuracy
- clustering method
- path planning
- significant improvement
- convergence rate
- improved algorithm
- experimental evaluation
- theoretical analysis
- linear programming
- computational cost
- k means
- objective function
- genetic algorithm