Enyu Yao

According to our database, Enyu Yao authored at least 12 papers between 2005 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2016

Capacity inverse minimum cost flow problems under the weighted Hamming distance.

Longcheng Liu, Enyu Yao

Optim. Lett., 2016

2013

Weighted inverse maximum perfect matching problems under the Hamming distance.

Longcheng Liu, Enyu Yao

J. Glob. Optim., 2013

Minimizing the maximum bump cost in linear extensions of a poset.

Biao Wu, Longcheng Liu, Enyu Yao

J. Comb. Optim., 2013

2012

Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance.

Longcheng Liu, Yong Chen, Biao Wu, Enyu Yao

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Minimizing the sum cost in linear extensions of a poset.

Longcheng Liu, Biao Wu, Enyu Yao

J. Comb. Optim., 2011

2010

A polynomially solvable case of optimal linear extension problem of a poset.

Biao Wu, Enyu Yao, Longcheng Liu

J. Comb. Optim., 2010

Inverse minimum cost flow problems under the weighted Hamming distance.

Yiwei Jiang, Longcheng Liu, Biao Wu, Enyu Yao

Eur. J. Oper. Res., 2010

2008

Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance.

Longcheng Liu, Enyu Yao

Theor. Comput. Sci., 2008

2007

On rearrangeable multirate three-stage Clos networks.

Wenqing Dou, Enyu Yao

Theor. Comput. Sci., 2007

A Weighted Inverse Minimum Cut Problem under the Bottleneck Type Hamming Distance.

Longcheng Liu, Enyu Yao

Asia Pac. J. Oper. Res., 2007

2006

Some further results on minimum distribution cost flow problems.

Haiyan Lu, Enyu Yao, Liqun Qi

J. Comb. Optim., 2006

2005

Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance.

Yong He, Binwu Zhang, Enyu Yao

J. Comb. Optim., 2005