We consider the problem of finding a Young diagram minimizing the sum of evaluations of a given pair of functions on the parts of the associated pair of conjugate partitions. While there are exponentially many diagrams, we show it is polynomial time solvable.

中文翻译：

---

年轻图的优化

我们考虑找到一个最小化一个给定函数对的相关对共轭分区部分的求和之和的Young图的问题。虽然有成倍的图表，但我们证明它是多项式时间可解的。