Branch-and-cut-and-price for multi-agent path finding (Q2147092): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2022.105809
+Normal rank
@@ Property / OpenAlex ID @@
+W4226155395
@@ Property / OpenAlex ID: W4226155395 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Price: Column Generation for Solving Huge Integer Programs
+Normal rank
@@ Property / cites work @@
+Column Generation
@@ Property / cites work: Column Generation / rank @@
+Normal rank
@@ Property / cites work @@
+Enhanced Partial Expansion A*
@@ Property / cites work: Enhanced Partial Expansion A* / rank @@
+Normal rank
@@ Property / cites work @@
+Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Nutmeg: a MIP and CP hybrid solver using branch-and-check
+Normal rank
@@ Property / cites work @@
+Projection results for vehicle routing
@@ Property / cites work: Projection results for vehicle routing / rank @@
+Normal rank
@@ Property / cites work @@
+Pairwise symmetry reasoning for multi-agent path finding search
+Normal rank
@@ Property / cites work @@
+Selected Topics in Column Generation
@@ Property / cites work: Selected Topics in Column Generation / rank @@
+Normal rank
@@ Property / cites work @@
+Propagation via lazy clause generation
@@ Property / cites work: Propagation via lazy clause generation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3583114
@@ Property / cites work: Q3583114 / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict-based search for optimal multi-agent pathfinding
+Normal rank