Branching to Find Feasible Solutions in Unmanned Air Vehicle Mission Planning.
Cristian Ramírez-AtenciaGema Bello OrgazMaría Dolores Rodríguez-MorenoDavid CamachoPublished in: IDEAL (2014)
Keyphrases
- mission planning
- feasible solution
- linear programming
- tabu search
- optimal solution
- objective function
- solution quality
- convex hull
- mixed integer program
- mathematical model
- branch and bound
- mixed integer
- lagrangian relaxation
- decision making
- solution space
- valid inequalities
- unmanned aerial vehicles
- autonomous vehicles
- high dimensional
- cost function
- infeasible solutions
- test problems
- linear programming relaxation
- scheduling problem