Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance. - Yong He; Binwu Zhang; Enyu Yao (J. Comb. Optim., 2005)

Some further results on minimum distribution cost flow problems. - Haiyan Lu; Enyu Yao; Liqun Qi 001 (J. Comb. Optim., 2006)

A Weighted Inverse Minimum Cut Problem under the Bottleneck Type Hamming Distance. - Longcheng Liu; Enyu Yao (Asia Pac. J. Oper. Res., 2007)

On rearrangeable multirate three-stage Clos networks. - Wenqing Dou; Enyu Yao (Theor. Comput. Sci., 2007)

Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance. - Longcheng Liu; Enyu Yao (Theor. Comput. Sci., 2008)

Inverse minimum cost flow problems under the weighted Hamming distance. - Yiwei Jiang; Longcheng Liu; Biao Wu 004; Enyu Yao (Eur. J. Oper. Res., 2010)

A polynomially solvable case of optimal linear extension problem of a poset. - Biao Wu 004; Enyu Yao; Longcheng Liu (J. Comb. Optim., 2010)

Minimizing the sum cost in linear extensions of a poset. - Longcheng Liu; Biao Wu 004; Enyu Yao (J. Comb. Optim., 2011)

Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance. - Longcheng Liu; Yong Chen 002; Biao Wu 004; Enyu Yao (FAW-AAIM, 2012)

Minimizing the maximum bump cost in linear extensions of a poset. - Biao Wu 004; Longcheng Liu; Enyu Yao (J. Comb. Optim., 2013)

Weighted inverse maximum perfect matching problems under the Hamming distance. - Longcheng Liu; Enyu Yao (J. Glob. Optim., 2013)

Capacity inverse minimum cost flow problems under the weighted Hamming distance. - Longcheng Liu; Enyu Yao (Optim. Lett., 2016)