Keyword: networks

Found 1865 papers in total
A non-linear congestion network model for planning internal movement in the Hajj
A non-linear congestion network model for planning internal movement in the Hajj
1989,
A non-linear congestion network model is developed for the Hajj case. The Hajj is one...
Stochastic network optimization models for investment planning
Stochastic network optimization models for investment planning
1989,
The authors describe and compare stochastic network optimization models for investment...
A minimum length covering subgraph of a network
A minimum length covering subgraph of a network
1989,
This paper concerns the problem of locating a central facility on a connected network...
Existence theory for spatially competitive network facility location models
Existence theory for spatially competitive network facility location models
1989,
Models for locating a firm’s production facilities while simultaneously...
A general framework for modeling production
A general framework for modeling production
1989,
The authors introduce a general framework that guides the management scientist’s...
Almost sure critical paths
Almost sure critical paths
1989,
M. Kress proved for a special case of Location-Scale probability distributions there...
A surrogate and Lagrangian approach to constrained network problems
A surrogate and Lagrangian approach to constrained network problems
1989,
This paper presents the use of surrogate constraints and Lagrange multipliers to...
Approximate analysis for the merge configuration of an open queueing network with blocking
Approximate analysis for the merge configuration of an open queueing network with blocking
1989,
A merge configuration of open queueing networks with exponential service times and...
Approximations for product departures from a single-server station with batch processing in multi-product queues
Approximations for product departures from a single-server station with batch processing in multi-product queues
1989,
In this paper the authors consider a single-server station processing jobs belonging...
A Lagrangian algorithm for computing the optimal service rates in Jackson queueing networks
A Lagrangian algorithm for computing the optimal service rates in Jackson queueing networks
1989,
Jackson queueing-network optimization problems with state-dependent service rates can...
Signalised intersections with variable flow rates: I. Analysis and simulation
Signalised intersections with variable flow rates: I. Analysis and simulation
1988,
One of the most common measures of signalized intersection operation is the amount of...
Algorithms and data structures for an expanded family of matroid intersection problems
Algorithms and data structures for an expanded family of matroid intersection problems
1989,
Consider a matroid or rank n in which each element has a real-valued cost and one of d...
The time complexity of maximum matching by simulated annealing
The time complexity of maximum matching by simulated annealing
1988,
The random, heuristic search algorithm called simulated annealing is considered for...
A parallel algorithm for finding a blocking flow in an acyclic network
A parallel algorithm for finding a blocking flow in an acyclic network
1989,
The authors propose a simple parallel algorithm for finding a blocking flow in an...
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
1989,
An algorithm is presented for finding a Hamiltonian cycle in 4-connected planar...
The parallel complexity of TSP Heuristics
The parallel complexity of TSP Heuristics
1989,
The authors consider eight heuristics for constructing approximate solutions to the...
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...
As fast parametric maximum flow algorithm and applications
As fast parametric maximum flow algorithm and applications
1989,
The classical maximum flow problem sometimes occurs in settings in which the arc...
An O(n2(m+nlogn)logn) min-cost flow algorithm
An O(n2(m+nlogn)logn) min-cost flow algorithm
1988,
The minimum-cost flow problem is: Given a network with n vertices and m edges, find a...
Improved complexity bounds for center location problems on networks by using dynamic data structures
Improved complexity bounds for center location problems on networks by using dynamic data structures
1988,
Several center location problems on general networks and even on tree networks are...
Probabilistic shortest path problems with budgetary constraints
Probabilistic shortest path problems with budgetary constraints
1989,
This paper presents an algorithm for finding approximate solutions to constrained...
Stable, distributed, real-time scheduling of flexible manufacturing/assembly/disassembly systems
Stable, distributed, real-time scheduling of flexible manufacturing/assembly/disassembly systems
1989,
The authors consider general flexible manufacturing/assembly/disassembly systems with...
Processing center location analysis for multiple branch banks
Processing center location analysis for multiple branch banks
1989,
Recently banks in the United States and Great Britain have acquired large numbers of...
Speeding up quickest-route assignments in CONTRAM with an heuristic algorithm
Speeding up quickest-route assignments in CONTRAM with an heuristic algorithm
1989,
The CONTRAM traffic assignment program uses a variation of Dijkstra’s...
Papers per page: