Journal: Networks

Found 487 papers in total
Universally maximum flow with piecewise-constant capacities
Universally maximum flow with piecewise-constant capacities
2001,
A maximum flow over time generalizes standard maximum flow by introducing a time...
Maximizing residual flow under an arc destruction
Maximizing residual flow under an arc destruction
2001,
In this paper, we consider two problems related to single-commodity flows on a...
Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm
Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm
2001,
The undirected multicommodity flow problem is encountered in the solution to...
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
2001,
For a finite set X , let c be a mapping which assigns to every two-element subset { u,...
A polynomial algorithm for a constrained traveling salesman problem
A polynomial algorithm for a constrained traveling salesman problem
2001,
We give a polynomial-time algorithm for finding a solution to the Traveling Salesman...
Robust location problems with pos/neg weights on a tree
Robust location problems with pos/neg weights on a tree
2001,
In this paper, we consider different aspects of robust 1-median problems on a tree...
A new–old algorithm for minimum-cut and maximum-flow in closure graphs
A new–old algorithm for minimum-cut and maximum-flow in closure graphs
2001,
We present an algorithm for solving the minimum-cut problem on closure graphs without...
Balanced network flows. IV. Duality and structure theory
Balanced network flows. IV. Duality and structure theory
2001,
In this paper, we present a theory for generalized graph factor problems which is...
Balanced network flows. V. Cycle-canceling algorithms
Balanced network flows. V. Cycle-canceling algorithms
2001,
We discuss Anstee's approach for solving generalized matching problems by solving an...
Balanced network flows. VI. Polyhedral descriptions
Balanced network flows. VI. Polyhedral descriptions
2001,
This paper discusses the balanced circulation polytope, that is, the convex hull of...
Characterization results of all shortest paths interval routing schemes
Characterization results of all shortest paths interval routing schemes
2001,
We give complete characterizations for the classes of graphs with uniform cost links...
Stability of networks and protocols in the adversarial queueing model for packet routing
Stability of networks and protocols in the adversarial queueing model for packet routing
2001,
The adversarial queueing theory model for packet routing was suggested by Borodin et...
Minimum-diameter covering problems
Minimum-diameter covering problems
2000,
A set V and a collection of (possibly nondisjoint) subsets are given. Also given is a...
A branch and cut method for the degree-constrained minimum spanning tree problem
A branch and cut method for the degree-constrained minimum spanning tree problem
2001,
A problem of interest in network design is that of finding, in a given weighted graph,...
The full-degree spanning tree problem
The full-degree spanning tree problem
2000,
The full-degree spanning tree problem is defined as follows: Given a connected graph G...
Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
2001,
In congested transportation and data networks, travel (or transmission) times are...
The capacitated arc routing problem with intermediate facilities
The capacitated arc routing problem with intermediate facilities
2001,
This article introduces the Capacitated Arc Routing with Intermediate Facilities...
Fault-tolerant routings in chordal ring networks
Fault-tolerant routings in chordal ring networks
2000,
This paper studies routing vulnerability in networks modeled by chordal ring graphs....
Low-congested interval routing schemes for hypercubelike networks
Low-congested interval routing schemes for hypercubelike networks
2000,
In this paper, we provide low-congested interval routing schemes (IRS) for some common...
Topological expansion of multiple-ring metropolitan area networks
Topological expansion of multiple-ring metropolitan area networks
2000,
This paper presents a mixed 0–1 linear programming model for the metropolitan...
An aggregation approach to solving the network p-median problem with link demands
An aggregation approach to solving the network p-median problem with link demands
2000,
This paper considers the p -median problem on a general network with link demands. We...
Optimal fault-tolerant networks with a server
Optimal fault-tolerant networks with a server
2000,
Fast computation through parallel processing and large distributed memory are two...
A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem
A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem
2000,
The Capacitated Minimum Spanning Tree Problem (CMSTP) is to find a minimum spanning...
The single allocation problem in the interacting three-hub network
The single allocation problem in the interacting three-hub network
2000,
We consider the single allocation problem in the interacting three-hub network with...
Papers per page: