An augmenting path method for solving Linear Bottleneck Assignment problems.
Ulrich DerigsUwe ZimmermannPublished in: Computing (1978)
Keyphrases
- algebraic equations
- quadratic programming
- high accuracy
- significant improvement
- high precision
- segmentation method
- computational cost
- clustering method
- image sequences
- closed form
- synthetic data
- optimization algorithm
- experimental evaluation
- decision trees
- pairwise
- probabilistic model
- mobile robot
- path planning
- cost function
- combinatorial optimization
- optimal path
- objective function
- preprocessing