Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Hi-index | 0.00 |
This extended abstract addresses the optimal assignment of spatially distributed tasks to a team of heterogeneous mobile agents in domains in which tasks may be related by precedence or simultaneity constraints and have a choice of locations at which they can be performed. The manner in which constraints are satisfied and the locations chosen for tasks both impact the overall team utility. We analyze the impact of these problem features on the efficiency of the solution process.