Paths and Matchings in an Automated Warehouse

Abstract

We analyze a number of variations of a combinatorial optimization problem arising from the optimization of an automated warehouse. We classify these variations according to four relevant parameters and we analyze which combinations are polynomially solvable, owing to dynamic programming recursions or to reductions to known graph optimization problems such as the shortest path problem and the minimum cost perfect matching problem.