Keyword: networks

Found 1865 papers in total
Netplan: A network optimization model for tactical planning in the less-than-truckload motor-carrier industry
Netplan: A network optimization model for tactical planning in the less-than-truckload motor-carrier industry
1989,
This paper reports on the use of a network optimization model for assisting...
Optimization of transport investment and pricing policies: The role of transport pricing in network design
Optimization of transport investment and pricing policies: The role of transport pricing in network design
1989,
This paper investigates the role of transport pricing in network design and describes...
Sequential filtering in connectionist networks to eliminate crosstalk problems
Sequential filtering in connectionist networks to eliminate crosstalk problems
1989,
A common problem with massively parallel networks is crosstalk: unwanted mutual...
A note on the decomposition of poly-linking systems and the minors of generalized polymatroids
A note on the decomposition of poly-linking systems and the minors of generalized polymatroids
1988,
In this note we shall describe the results obtained by applying an established...
Decomposition approximation of queueing-network control models with three structures
Decomposition approximation of queueing-network control models with three structures
1987,
We devise a decomposition approximation method for a general branching queueing...
A light-traffic approximation for single-class departure processes from multi-class queues
A light-traffic approximation for single-class departure processes from multi-class queues
1988,
This paper discusses an approximation for single-class departure processes from...
Solving a large scale districting problem: A case report
Solving a large scale districting problem: A case report
1988,
The paper deals with the problem of defining the territories for 168 sales agents of a...
Dynamic reliability as an alternative to overall data base restoration
Dynamic reliability as an alternative to overall data base restoration
1989,
A model and mechanism for the dynamic reliability and recovery of data base search...
An algorithm for single constraint maximum collection problem
An algorithm for single constraint maximum collection problem
1988,
There are many studies which consider an optimal tour on a given graph including the...
Multiple shift workforce lower bounds
Multiple shift workforce lower bounds
1988,
Previous lower bounds on workforce size have been derived from the consideration that...
Power system network parameter estimation
Power system network parameter estimation
1988,
Methods for power network parameter estimation and correction are discussed in this...
The part mix and routing mix problem in FMS: A coupling between an LP model and a closed queueing network
The part mix and routing mix problem in FMS: A coupling between an LP model and a closed queueing network
1988,
In the near future many companies will face the problem of the optimal use of newly...
Shortest path algorithms
Shortest path algorithms
1988,
The shortest path problem is considered from a computational point of view. Eight...
A computational comparison of the Dinic and network simplex methods for maximum flow
A computational comparison of the Dinic and network simplex methods for maximum flow
1988,
The authors study the implementation of two fundamentally different algorithms for...
The relax codes for linear minimum cost network flow problems
The relax codes for linear minimum cost network flow problems
1988,
The authors describe a relaxation algorithm for solving the classical minimum cost...
Solving non-bipartite matching problems via shortest path techniques
Solving non-bipartite matching problems via shortest path techniques
1988,
The paper describes a matching code which is based on an efficient labeling technique...
Algorithms for finding optimum trees: Description, use and evaluation
Algorithms for finding optimum trees: Description, use and evaluation
1988,
This work is devoted to the problem of finding an optimum spanning tree in an...
Papers per page: