This paper considers the Red–Blue Transportation Problem (Red–Blue TP), a generalization of the transportation problem where supply nodes are partitioned into two sets and so-called exclusionary constraints are imposed. We encountered a special case of this problem in a hospital context, where patients need to be assigned to rooms. We establish the problem’s complexity, and we compare two integer programming formulations. Furthermore, a maximization variant of Red–Blue TP is presented, for which we propose a constant-factor approximation algorithm. We conclude with a computational study on the performance of the integer programming formulations and the approximation algorithms, by varying the problem size, the partitioning of the supply nodes, and the density of the problem.
|Titolo:||The Red–Blue transportation problem|
|Data di pubblicazione:||2014|
|Digital Object Identifier (DOI):||10.1016/j.ejor.2014.02.055|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto: