Branch-and-cut-and-price for multi-agent path finding
From MaRDI portal
Publication:2147092
DOI10.1016/j.cor.2022.105809OpenAlexW4226155395MaRDI QIDQ2147092
Daniel Harabor, Edward Lam, Pierre Le Bodic, Peter J. Stuckey
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105809
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Pairwise symmetry reasoning for multi-agent path finding search
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- Propagation via lazy clause generation
- Conflict-based search for optimal multi-agent pathfinding
- Projection results for vehicle routing
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Column Generation
- Selected Topics in Column Generation
- Enhanced Partial Expansion A*
This page was built for publication: Branch-and-cut-and-price for multi-agent path finding