Yao Enyu

Enyu Yao

Information about the author Enyu Yao will soon be added to the site.
Found 8 papers in total
Weighted inverse maximum perfect matching problems under the Hamming distance
Weighted inverse maximum perfect matching problems under the Hamming distance
2013
Given an undirected network G ( V , E , c ) and a perfect matching M 0 , the inverse...
Minimizing the sum cost in linear extensions of a poset
Minimizing the sum cost in linear extensions of a poset
2011
A linear extension problem is defined as follows: Given a poset P =( E ,≤), we want...
A weighted inverse minimum cut problem under the bottleneck type Hamming distance
A weighted inverse minimum cut problem under the bottleneck type Hamming distance
2007
An inverse optimization problem is defined as follows. Let S denote the set of...
Some further results on minimum distribution cost flow problems
Some further results on minimum distribution cost flow problems
2006
Manufacturing network flow (MNF) is a generalized network model that can model more...
Semidefinite relaxation of kanpsack problem
Semidefinite relaxation of kanpsack problem
2002
Knapsack is a classical NP-hard problem. In the last ten years, semi-definite...
Semi-definite relaxation algorithm for the multiple knapsack problem
Semi-definite relaxation algorithm for the multiple knapsack problem
2002
The multiple knapsack problem denoted by MKP(B,S,m,n) can be defined as follows. A set...
The flow shop problem with a server
The flow shop problem with a server
2000
The classic flow shop problem is widely researched. In this paper, the flowshop...
The complexity and approximation algorithm of three parallel machines scheduling problem with servers
The complexity and approximation algorithm of three parallel machines scheduling problem with servers
2000
The problem of scheduling n jobs on 3 parallel identical machines which are tended by...
Papers per page: