Enyu Yao

13 papers Journal 11Unranked 2
YearRankTypeTitle / Venue / Authors
2016 J jnl
Capacity inverse minimum cost flow problems under the weighted Hamming distance.
Optim. Lett.
Longcheng Liu, Enyu Yao
2013 J jnl
Minimizing the maximum bump cost in linear extensions of a poset.
J. Comb. Optim.
Biao Wu, Longcheng Liu, Enyu Yao
2013 J jnl
Weighted inverse maximum perfect matching problems under the Hamming distance.
J. Glob. Optim.
Longcheng Liu, Enyu Yao
2012 — conf
Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance.
FAW-AAIM
Longcheng Liu, Yong Chen, Biao Wu, Enyu Yao
2011 J jnl
Minimizing the sum cost in linear extensions of a poset.
J. Comb. Optim.
Longcheng Liu, Biao Wu, Enyu Yao
2010 J jnl
A polynomially solvable case of optimal linear extension problem of a poset.
J. Comb. Optim.
Biao Wu, Enyu Yao, Longcheng Liu
2010 J jnl
Inverse minimum cost flow problems under the weighted Hamming distance.
Eur. J. Oper. Res.
Yiwei Jiang, Longcheng Liu, Biao Wu, Enyu Yao
2008 J jnl
Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance.
Theor. Comput. Sci.
Longcheng Liu, Enyu Yao
2007 J jnl
A Weighted Inverse Minimum Cut Problem under the Bottleneck Type Hamming Distance.
Asia Pac. J. Oper. Res.
Longcheng Liu, Enyu Yao
2007 — conf
Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance.
ESCAPE
Longcheng Liu, Enyu Yao
2007 J jnl
On rearrangeable multirate three-stage Clos networks.
Theor. Comput. Sci.
Wenqing Dou, Enyu Yao
2006 J jnl
Some further results on minimum distribution cost flow problems.
J. Comb. Optim.
Haiyan Lu, Enyu Yao, Liqun Qi
2005 J jnl
Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance.
J. Comb. Optim.
Yong He, Binwu Zhang, Enyu Yao