Between a rock and a hard place : the two-to-one assignment problem

D. Goossens, S. Polyakovskiy, F.C.R. Spieksma, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)
1 Downloads (Pure)


We describe the two-to-one assignment problem, a problem in between the axial three-index assignment problem and the three-dimensional matching problem, having applications in various domains. For the (relevant) case of decomposable costs satisfying the triangle inequality we provide, on the positive side, two constant factor approximation algorithms. These algorithms involve solving minimum weight matching problems and transportation problems, leading to a 2-approximation, and a 3/2-approximation. Moreover, we further show that the best of these two solutions is a 4/3-approximation for our problem. On the negative side, we show that the existence of a polynomial time approximation scheme for our problem would imply P = NP. Finally, we report on some computational experiments showing the performance of the described heuristics.
Original languageEnglish
Pages (from-to)223-237
JournalMathematical Methods of Operations Research
Issue number2
Publication statusPublished - 2012


Dive into the research topics of 'Between a rock and a hard place : the two-to-one assignment problem'. Together they form a unique fingerprint.

Cite this