New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding.
Edward LamPierre Le BodicPublished in: ICAPS (2020)
Keyphrases
- path finding
- valid inequalities
- multi agent
- integer programming
- traveling salesman problem
- mixed integer programming
- mixed integer
- linear programming
- cutting plane
- lower and upper bounds
- feasible solution
- convex hull
- path planning
- column generation
- heuristic search
- search algorithm
- network design problem
- primal dual
- integer program
- continuous variables
- facet defining inequalities
- rule learning
- optimal path
- tree search
- reinforcement learning
- hill climbing
- lagrangian relaxation
- lower bound
- lot sizing
- constraint programming
- linear program
- objective function
- combinatorial optimization
- mathematical model
- np complete
- special case
- search space
- optimal solution