Optimization over Young diagrams
暂无分享,去创建一个
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.
[1] William J. Cook,et al. Combinatorial optimization , 1997 .
[2] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[3] T. Inui,et al. The Symmetric Group , 1990 .