Keyword: networks: flow

Found 611 papers in total
Operator assignment and the parametric preflow algorithm
Operator assignment and the parametric preflow algorithm
1992,
This note addresses a problem of assigning human operators to operations in a...
A network penalty method
A network penalty method
1991,
The authors consider the minimum cost network flow problem and describe how the...
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
1991,
Goldfarb and Hao have proposed a pivot rule for the primal network simplex algorithm...
Finding minimum-cost flows by double scaling
Finding minimum-cost flows by double scaling
1992,
Several researchers have recently developed new techniques that give fast algorithms...
State-dependent queueing models in emergency evacuation networks
State-dependent queueing models in emergency evacuation networks
1991,
Planning and design of evacuation networks is both a complex and critically important...
Topological design of telecommunications networks-Local access design methods
Topological design of telecommunications networks-Local access design methods
1991,
Computer communication networks and telecommunication systems are growing at an...
Alternatives for reliable and quality telecommunication network design
Alternatives for reliable and quality telecommunication network design
1991,
In today’s highly competitive telecommunication market, customers expect and...
A multiple arc network model of production planning in a steel mill
A multiple arc network model of production planning in a steel mill
1991,
The problem of production planning in a steel mill with the objective of maximising...
A dynamic deterministic model for international cash management
A dynamic deterministic model for international cash management
1991,
The continual growth and proliferation of multinational firms has made the task of...
On the expected maximum flow in probabilistic networks
On the expected maximum flow in probabilistic networks
1989,
The reliability of capacitated networ
A new approach to the maximum-flow problem
A new approach to the maximum-flow problem
1988,
All previously known efficient maximum-flow algorithms work by finding augmenting...
Papers per page: