We show that the following problem is NP-hard, and hence computationally intractable: "Given a vector y that Lorenz-dominates a vector x, what is the smallest number of Muirhead–Dalton transfers that transform x into y?"
V.G. Deineko, B. Klinz, G.J. Woeginger
Research output: Contribution to journal › Article › Academic › peer-review