We consider a special class of axial multi-dimensional assignment problems called multi-dimensional vector assignment (MVA) problems. An instance of the MVA problem is defined by m disjoint sets, each of which contains the same number n of p-dimensional vectors with nonnegative integral...

A fundamental step in any cutting plane algorithm is separation: deciding whether a violated inequality exists within a certain class of inequalities. It is customary to express the complexity of a separation algorithm in n, the number of variables. Here, we argue that the input to a separation...

We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book/Assignment 'Problems' by Burkard et al. (2009) on pages 188-189. One of the applications described there concerns bus driver scheduling.We view the problem as a special case of a...