Journal: Networks

Found 487 papers in total
Approximation algorithms for the k-source multicast tree construction problem
Approximation algorithms for the k-source multicast tree construction problem
2006,
Given an undirected graph with nonnegative weights on its edges, a group of source...
Maximal vertex-connectivity of Sn,k
Maximal vertex-connectivity of Sn,k
2005,
The class of star graphs is a popular topology for interconnection networks. However,...
A branch-and-price approach for the maximum weight independent set problem
A branch-and-price approach for the maximum weight independent set problem
2005,
The maximum weight-independent set problem (MWISP) is one of the most well-known and...
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
2005,
The Conditional Covering Problem (CCP) is a facility location problem on a graph,...
A dynamic programming algorithm for the conditional covering problem on tree graphs
A dynamic programming algorithm for the conditional covering problem on tree graphs
2005,
In a previous article, we presented algorithms for solving the Conditional Covering...
Reliable broadcasting in double loop networks
Reliable broadcasting in double loop networks
2005,
Broadcast is the fundamental collective communication routine in which the same...
Near-shortest and K-shortest simple paths
Near-shortest and K-shortest simple paths
2005,
We present a new algorithm for enumerating all near-shortest simple (loopless) s-t...
On a routing and scheduling problem concerning multiple edge traversals in graphs
On a routing and scheduling problem concerning multiple edge traversals in graphs
2005,
Practical vehicle routing problems generally have both routing and scheduling aspects...
An approximation algorithm for Stackelberg network pricing
An approximation algorithm for Stackelberg network pricing
2005,
We consider the problem of maximizing the revenue raised from tolls set on the arcs of...
Design of survivable networks: A survey
Design of survivable networks: A survey
2005,
For the past few decades, combinatorial optimization techniques have been shown to be...
Competitive routing in multicast communications
Competitive routing in multicast communications
2005,
We consider competitive routing in multicast networks from a noncooperative game...
Efficient neighborhood search for the probabalistic pickup and delivery travelling salesman problem
Efficient neighborhood search for the probabalistic pickup and delivery travelling salesman problem
2005,
In this article the probabilistic pickup and delivery travelling salesman problem is...
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem
2005,
This article is motivated by versions of the dynamic or ‘on-line’ Steiner...
Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network
Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network
2005,
Cost reduction is a major concern when designing optical fiber networks....
A branch-and-price algorithm for the capacitated p-median problem
A branch-and-price algorithm for the capacitated p-median problem
2005,
The capacitated p -median problem is the variation of the well-known p -median problem...
Solving the undirected minimum cost flow problem with arbitrary costs
Solving the undirected minimum cost flow problem with arbitrary costs
2005,
We address the undirected minimum cost flow problem with arbitrary arcs costs. Any...
Parallel scheduling problems in next generation wireless networks
Parallel scheduling problems in next generation wireless networks
2005,
Next-generation 3G/4G wireless data networks allow multiple codes (or channels) to be...
On the minimum number of wavelengths in multicast trees in Wavelength Division Multiplexing networks
On the minimum number of wavelengths in multicast trees in Wavelength Division Multiplexing networks
2005,
We consider the problem of minimizing the number of wavelengths needed to connect a...
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
2004,
In this article, we propose a solution procedure for the Elementary Shortest Path...
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
2005,
In this article, we study the modulation of intensity matrices arising in cancer...
A competitive scheduling problem and its relevance to Universal Mobile Telecommunications System channel assignment
A competitive scheduling problem and its relevance to Universal Mobile Telecommunications System channel assignment
2004,
This article investigates a two-user competitive scheduling problem. The problem...
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
2004,
The fleet assignment model (FAM) for an airline assigns fleet types to a set of flight...
Solving the Hub location problem in telecommunication network design: A local search approach
Solving the Hub location problem in telecommunication network design: A local search approach
2004,
This article deals with a Hub Location Problem arising in Telecommunication Network...
A network flow approach to cost allocation for rooted trees
A network flow approach to cost allocation for rooted trees
2004,
In the game theory approach to cost allocation, the main computational issue is an...
Papers per page: