Journal: Networks

Found 487 papers in total
A dual-ascent procedure for the file allocation and join site selection problem on a telecommunications network
A dual-ascent procedure for the file allocation and join site selection problem on a telecommunications network
1999,
In this paper, a model and a solution procedure is developed for the File Allocation...
Transmissions in a network with capacities and delays
Transmissions in a network with capacities and delays
1999,
We examine the problem of transmitting in minimum time a given amount of data between...
All-to-all communication for some wavelength-routed all-optical networks
All-to-all communication for some wavelength-routed all-optical networks
1999,
This paper studies the problem of all-to-all communication for optical networks. In...
Lower bounds for linear interval routing
Lower bounds for linear interval routing
1999,
Linear interval routing is a space-efficient routing method for point-to-point...
Deadlock-free interval routing schemes
Deadlock-free interval routing schemes
1999,
k -Interval labeling schemes ( k -ILS) are compact routing schemes on general networks...
A competitive analysis for retransmission timeout
A competitive analysis for retransmission timeout
1999,
Protocols that provide reliable communication on top of a network that can lose...
Greedy online algorithms for routing permanent virtual circuits
Greedy online algorithms for routing permanent virtual circuits
1999,
We analyze the competitive ratio of two greedy online algorithms for routing permanent...
Dynamic multi-sector, multi-instrument financial networks with futures: Modeling and computation
Dynamic multi-sector, multi-instrument financial networks with futures: Modeling and computation
1999,
In this paper, we develop a dynamic model of financial behavior in the case of...
Multidimensional assortment problem with an application
Multidimensional assortment problem with an application
1999,
This paper addresses the discrete multidimensional assortment problem. Assortment...
Locating replicas of a database on a network
Locating replicas of a database on a network
1997,
We study the problem of locating replicas of a database on a network to minimize the...
Linear time algorithms for computing the most reliable source on an unreliable tree network
Linear time algorithms for computing the most reliable source on an unreliable tree network
1997,
Given a tree network with n vertices where each edge has an operational probability,...
Exact reliabilities of most reliable double-loop networks
Exact reliabilities of most reliable double-loop networks
1997,
A double-loop network with hop constaints h 1 , h 2 , DL(n, h 1 , h 2 ) may be...
A note on genetic algorithms for degree-constrained spanning tree problems
A note on genetic algorithms for degree-constrained spanning tree problems
1997,
The degree-constrained spanning tree problem is of high practical importance. Up to...
Maximizing spanning trees in almost complete graphs
Maximizing spanning trees in almost complete graphs
1997,
We examine the family of graphs whose complements are a union of paths and cycles and...
A computationally efficient method for nonlinear multicommodity network flow problems
A computationally efficient method for nonlinear multicommodity network flow problems
1997,
In this paper, we present a new method for solving nonlinear multicommodity network...
Commodity family extended formulations of uncapacitated fixed charge network flow problems
Commodity family extended formulations of uncapacitated fixed charge network flow problems
1997,
Uncapacitated fixed charge network flow problems are single-commodity flow problems...
State space partitioning methods for stochastic shortest path problems
State space partitioning methods for stochastic shortest path problems
1997,
This paper describes methods for computing measures related to shortest paths in...
A tabu search heuristic for periodic and multi-depot vehicle routing problems
A tabu search heuristic for periodic and multi-depot vehicle routing problems
1997,
We propose a tabu search heuristic capable of solving three well-known routing...
Network decomposition of general financial equilibria with transaction costs
Network decomposition of general financial equilibria with transaction costs
1996,
In this paper, we developed a new general financial equilibrium model with transaction...
Balanced graphs and network flows
Balanced graphs and network flows
1997,
A graph G is balanced if the maximum ratio of edges to vertices, taken over all...
A note on Bertsekas' small-label-first strategy
A note on Bertsekas' small-label-first strategy
1997,
An example is presented to show that the worst-case complexity of Bertsekas'...
Dual algorithms for the shortest path tree problem
Dual algorithms for the shortest path tree problem
1997,
We consider dual approaches for the Shortest Path Tree problem. After a brief...
Time-varying shortest path problems with constraints
Time-varying shortest path problems with constraints
1997,
We study a new version of the shortest path problem. Let G = (V, E) be a directed...
The wide-diameter of the n-dimensional toroidal mesh
The wide-diameter of the n-dimensional toroidal mesh
1996,
In graph theory and a study of transmission delay and fault tolerance of networks, the...
Papers per page: