A Sparse Branch and Bound Optimization of Noisy Weighted DAG Modification Under Constraints: A Method for Monocular Data Association to Multiple Laser Planes.
Faisal R. Al-OsaimiPublished in: IEEE Access (2021)
Keyphrases
- branch and bound
- combinatorial optimization
- data association
- multi target tracking
- branch and bound method
- multiple objects
- three dimensional
- lower bound
- cost function
- dynamic programming
- upper bound
- optimization problems
- linear programming
- high dimensional
- branch and bound algorithm
- search algorithm
- objective function
- bayesian networks
- genetic algorithm