Journal: Networks

Found 487 papers in total
Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem
Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem
2003,
Much has been written on shortest path problems with weight, or resource, constraints....
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
2003,
We consider the problem of searching for a piece of information in a fully...
Network optimization in supply chain management and financial engineering: An annotated bibliography
Network optimization in supply chain management and financial engineering: An annotated bibliography
2003,
During the past decade, two relatively new application areas have attracted the...
An annotated bibliography of network interior point methods
An annotated bibliography of network interior point methods
2003,
This paper presents an annotated bibliography on interior point methods for solving...
Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O(√(n)mlog(n2/m)/log n) bound for the nonbipartite cardinality matching problem
Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O(√(n)mlog(n2/m)/log n) bound for the nonbipartite cardinality matching problem
2003,
This paper closes some gaps in the discussion of nonweighted balanced network flow...
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem
2003,
We present a branch-and-cut algorithm to solve the single-commodity, uncapacitated,...
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
2003,
We formulate and computationally test several models for the Diameter-Constrained...
Some recent contributions to routing and location problems
Some recent contributions to routing and location problems
2003,
This report is more than just a summary of some results of the present state of the...
A numerical tool for multiattribute ranking problems
A numerical tool for multiattribute ranking problems
2003,
A large variety of techniques have been developed to solve or approximate the solution...
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
2003,
In this paper, we describe a new integer programming formulation for the Traveling...
The single-vehicle routing problem with unrestricted backhauls
The single-vehicle routing problem with unrestricted backhauls
2003,
Suppose that a private carrier delivers to a set of customers and also has a number of...
Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks
Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks
2003,
The source-to-all maximum cost-to-time ratio problem is the problem of finding the...
The determination of the path with minimum-cost norm value
The determination of the path with minimum-cost norm value
2003,
The multiobjective shortest path problem (MSPP) consists of finding the best...
Dynamic shortest paths minimizing travel times and costs
Dynamic shortest paths minimizing travel times and costs
2003,
In this paper, we study dynamic shortest path problems that determine a shortest path...
A bicriterion approach for routing problems in multimedia networks
A bicriterion approach for routing problems in multimedia networks
2003,
Routing problems in communication networks supporting multiple services, namely,...
Exact algorithms for minimum routing cost trees
Exact algorithms for minimum routing cost trees
2002,
Given a set of points and distances between them, a basic problem in network design...
Dimensioning multicast-enabled communications networks
Dimensioning multicast-enabled communications networks
2002,
This paper concerns the network design problem of dimensioning capacity, available in...
An improved algorithm for the minmax regret median problem on a tree
An improved algorithm for the minmax regret median problem on a tree
2003,
We consider the 1-median problem with uncertain weights for nodes. Specifically, for...
Approximation algorithms for constructing wavelength routing networks
Approximation algorithms for constructing wavelength routing networks
2002,
Consider a requirement graph whose vertices represent customers and an edge represents...
Reserving resilient capacity for a single commodity with upper-bound constraints
Reserving resilient capacity for a single commodity with upper-bound constraints
2003,
Continuing research begun in a previous study, we investigate problems of reserving...
Degree- and time-constrained broadcast networks
Degree- and time-constrained broadcast networks
2002,
We consider the problem of constructing networks with as many nodes as possible,...
Shortest-path network interdiction
Shortest-path network interdiction
2002,
We study the problem of interdicting the arcs in a network in order to maximize the...
A polynomial-time algorithm to find shortest paths with recourse
A polynomial-time algorithm to find shortest paths with recourse
2003,
The Shortest Path with Recourse Problem involves finding the shortest expected-length...
A note on the traveling repairman problem
A note on the traveling repairman problem
2002,
Given a finite set of N nodes and the time required for traveling among nodes, in the...
Papers per page: