Keyword: networks: flow

Found 611 papers in total
Optimal routing designs in self-healing communications networks
Optimal routing designs in self-healing communications networks
1996,
Self-healing communication networks that allow re-routing of demands through switching...
Setting base stock levels using product-form queueing networks
Setting base stock levels using product-form queueing networks
1996,
A manufacturing facility produces multiple products in a make-to-stock manner, and...
Constructing a cactus representation for all minimum cuts in an undirected network
Constructing a cactus representation for all minimum cuts in an undirected network
1996,
The construction of a cactus representation for all minimum cuts in an edge-weighted,...
Computational experience with a difficult mixed-integer multicommodity flow problem
Computational experience with a difficult mixed-integer multicommodity flow problem
1995,
The following problem arises in the study of lightwave networks. Given a demand matrix...
Forest management: A multicommodity flow formulation and sensitivity analysis
Forest management: A multicommodity flow formulation and sensitivity analysis
1995,
The authors formulate the Forest Management Problem as a Multicommodity Network Flow...
Dynamic processes and equilibrium in transportation networks: Toward a unifying theory
Dynamic processes and equilibrium in transportation networks: Toward a unifying theory
1995,
Traditionally, traffic assignment models, both for within-day static and dynamic...
A note on evaluating the overflow probability using the infinite queue
A note on evaluating the overflow probability using the infinite queue
1995,
This note evaluates the approximation of overflow probability put forward by...
Implementing an efficient minimum capacity cut algorithm
Implementing an efficient minimum capacity cut algorithm
1994,
In this paper, the authors present an efficient implementation for the O(mn+n 2...
The controlled rounding problem: Complexity and computational experience
The controlled rounding problem: Complexity and computational experience
1993,
Controlled rounding is a procedure whereby tabular data gathered from respondents is...
The vehicle routing problem with time constraints
The vehicle routing problem with time constraints
1995,
This paper deals with a vehicle routing problem of finding the minimum number of...
PERT and crashing revisited: Mathematical generalizations
PERT and crashing revisited: Mathematical generalizations
1993,
The authors consider a generalization of PERT where task durations are variable and...
On the k-cut subgraph polytope
On the k-cut subgraph polytope
1994,
The authors consider the problem of finding a minimum-cost set of k- pairwise-disjoint...
Human migration networks
Human migration networks
1992,
In this paper the authors develop a new multiclass human migration network equilibrium...
Algorithms for capacitated, multi-item lot-sizing without set-ups
Algorithms for capacitated, multi-item lot-sizing without set-ups
1995,
The multi-item lot-sizing problem considered here is concerned with finding the lot...
Intermodal pricing using network flow techniques
Intermodal pricing using network flow techniques
1995,
Traditional cost calculations do not accurately estimate the opportunity costs of...
Half-integral flows in a planar graph with four holes
Half-integral flows in a planar graph with four holes
1995,
Suppose that s a planar graph embedded in the conclusion plane, that I, J, K, O are...
A computer-aided process planning model based on genetic algorithms
A computer-aided process planning model based on genetic algorithms
1995,
A process planning model is developed in conjunction with a genetic algorithm. The...
Sampling strategies for two-fluid model parameter estimation in urban networks
Sampling strategies for two-fluid model parameter estimation in urban networks
1995,
The basic postulate of the two-fluid theory of town traffic relates the average speed...
The inspection station location problem in hazardous material transportation: Some heuristics and bounds
The inspection station location problem in hazardous material transportation: Some heuristics and bounds
1995,
To enforce rules regarding hazardous material transportation, regulating agencies need...
Strongly polynomial time algorithms for certain concave minimization problems on networks
Strongly polynomial time algorithms for certain concave minimization problems on networks
1993,
A parametric method is proposed for solving a special production-transportation...
A set covering reformulation of the pure fixed charge transportation problem
A set covering reformulation of the pure fixed charge transportation problem
1994,
The pure fixed charge transportation problem is reformulated into an equivalent set...
An incremental primal-dual method for generalized networks
An incremental primal-dual method for generalized networks
1994,
The primal simplex method has been computationally superior to primal-dual simplex and...
An algorithm for the multiattribute, multicommodity flow problem with freight consolidation and inventory costs
An algorithm for the multiattribute, multicommodity flow problem with freight consolidation and inventory costs
1994,
To remain competitive, manufacturers must seek transportation strategies that both...
Parallel simplex for large pure network problems: Computational testing and sources of speedup
Parallel simplex for large pure network problems: Computational testing and sources of speedup
1994,
This paper reports on a new parallel implementation of the primal simplex method for...
Papers per page: