Branch-and-cut-and-price for multi-agent path finding
| Year of publication: |
2022
|
|---|---|
| Authors: | Lam, Edward ; Le Bodic, Pierre ; Harabor, Daniel ; Stuckey, Peter J. |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 144.2022, p. 1-13
|
| Subject: | Column generation | Cutting plane | Multi-agent path finding | Multi-agent planning | Valid inequality | Agentenbasierte Modellierung | Agent-based modeling | Theorie | Theory | Operations Research | Operations research |
-
Distributed integral column generation for set partitioning problems
Foutlane, Omar, (2022)
-
López-Sánchez, Aitor, (2026)
-
Optimal multi-agent pickup and delivery using branch-and-cut-and-price algorithms
Lam, Edward, (2025)
- More ...
-
Kazemi, Ahmad, (2021)
-
Locomotive fuel management with inline refueling
Kazemi, Ahmad, (2021)
-
Estimating the size of branch-and-bound trees
Hendel, Gregor Christian, (2022)
- More ...