10 citations · 44 across the 13 of their papers we have counts for
3 papers · 1 filter
Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
Marco Locatelli, Veronica Piccialli, Antonio M. Sudoso
In this paper, we propose a branch-and-bound algorithm for solving nonconvex quadratic programming problems with box constraints (BoxQP). Our approach combines existing tools, such…
Constrained Multi-Agent Path Finding on Directed Graphs
Stefano Ardizzoni, Luca Consolini, Marco Locatelli +1
We discuss C-MP and C-MAPF, generalizations of the classical Motion Planning (MP) and Multi-Agent Path Finding (MAPF) problems on a directed graph G. Namely, we enforce an upper bo…
Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms
Stefano Ardizzoni, Irene Saccani, Luca Consolini +1
On an assigned graph, the problem of Multi-Agent Pathfinding (MAPF) consists in finding paths for multiple agents, avoiding collisions. Finding the minimum-length solution is known…