Chen Y.L.

Y.L. Chen

Information about the author Y.L. Chen will soon be added to the site.
Found 10 papers in total
Minimum time paths in a network with mixed time constraints
Minimum time paths in a network with mixed time constraints
1998
The time-constrained shortest path problem is an important generalization of the...
A fuzzy interval multiobjective mixed integer programming approach for the optimal planning of solid waste management systems
A fuzzy interval multiobjective mixed integer programming approach for the optimal planning of solid waste management systems
1997
Various deterministic mathematical programming models were developed to evaluate...
A parametric maximum flow algorithm for bipartite graphs with applications
A parametric maximum flow algorithm for bipartite graphs with applications
1995
Suppose we are given a capacitated bipartite network G with node sets S and T . In...
The minimal average cost flow problem
The minimal average cost flow problem
1995
Given a network with flow costs and arc capacities, the classical min-cost flow...
The hybrid spanning tree problem
The hybrid spanning tree problem
1994
The minimal spanning tree problem is a well-known problem in operations research. In...
Scheduling jobs to minimize total cost
Scheduling jobs to minimize total cost
1994
The problem of preemptively scheduling a set of independent jobs with release times...
An algorithm for finding the k quickest paths in a network
An algorithm for finding the k quickest paths in a network
1993
Let N be a network with n nodes and m arcs, and let σ be the amount of data to...
Multicommodity network flows with safety considerations
Multicommodity network flows with safety considerations
1992
Previous research on the multicommodity minimum cost flow problem (MMCFP) has assumed...
The quickest path problem
The quickest path problem
1990
Let N be an input network and σ be the amount of data to be transmitted. The...
Scheduling unit-time jobs on processors with different capabilities
Scheduling unit-time jobs on processors with different capabilities
1989
Let J={J 1 ,J 2 ,...,J n } be a set of unit execution-time jobs and P={P 1 ,P 2 ,...,P...
Papers per page: