Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients


Given three n-element sequences a i ; b i and c i of nonnega-tive real numbers, the aim is to nd two permutations and such that the sum P n i=1 a i b (i) c (i) is minimized (maximized, respectively). We show that the maximization version of this problem can be solved in polynomial time, whereas we present an NP-completeness proof for the minimization… (More)
DOI: 10.1016/0166-218X(95)00031-L


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics