Branch-and-cut-and-price for multi-agent path finding
- 6 April 2022
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 144
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path FindingProceedings of the AAAI Conference on Artificial Intelligence, 2019
- Cooperative Multi-Agent PlanningACM Computing Surveys, 2017
- Conflict-based search for optimal multi-agent pathfindingArtificial Intelligence, 2015
- Enhanced Partial Expansion A*Journal of Artificial Intelligence Research, 2014
- Constraint-based multi-robot path planning2010
- Propagation via lazy clause generationConstraints, 2009
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time WindowsOperations Research, 2008
- Selected Topics in Column GenerationOperations Research, 2005
- Projection results for vehicle routingMathematical Programming, 2005
- Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOperations Research, 1998