Journal: Networks

Found 487 papers in total
Source-limited inclusive routing: A new paradigm for multicast communication
Source-limited inclusive routing: A new paradigm for multicast communication
2000,
In this paper, we study a combination of the multicast communication problem and the...
Network reliability with node failures
Network reliability with node failures
2000,
Given a graph whose edges never fail but whose nodes fail independently of each other...
State space partition algorithms for stochastic systems with applications to minimum spanning trees
State space partition algorithms for stochastic systems with applications to minimum spanning trees
2000,
We investigated state space partition methods for computing probability measures...
The searchlight guarding problem on weighted split graphs and weighted cographs
The searchlight guarding problem on weighted split graphs and weighted cographs
2000,
This paper addresses the searchlight guarding problem, which is an extension of...
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
2000,
In this paper, we investigate a probabilistic local majority polling game on weighted...
Constrained length connectivity and survivable networks
Constrained length connectivity and survivable networks
2000,
Some problems related to constrained length connectivity are addressed in this paper....
Channel assignment and weighted coloring
Channel assignment and weighted coloring
2000,
In cellular telephone networks, set of radio channels (colors) must be assigned to...
Tabu search for the Steiner problem in graphs
Tabu search for the Steiner problem in graphs
2000,
Given an undirected graph with weights associated with its edges, the Steiner tree...
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
2000,
In this paper, we propose an efficient heuristic approach for solving concave...
A characterization of the two-commodity network design problem
A characterization of the two-commodity network design problem
2000,
We study the uncapacitated version of the two-commodity network design problem. We...
New polynomial-time cycle-canceling algorithms for minimum-cost flows
New polynomial-time cycle-canceling algorithms for minimum-cost flows
2000,
The cycle-canceling algorithm is one of the earliest algorithms to solve the...
Robust path choice in networks with failures
Robust path choice in networks with failures
2000,
The problem of adaptive routing in a network with failures is considered. The network...
The cardinality-constrained shortest path problem in 2-graphs
The cardinality-constrained shortest path problem in 2-graphs
2000,
We study the cardinality-constrained shortest path problem in acyclic graphs and, in...
A general framework for functional networks
A general framework for functional networks
2000,
In this paper, we introduce functional networks as a generalization and extension of...
A truncated primal-infeasible dual-feasible network interior point mathod
A truncated primal-infeasible dual-feasible network interior point mathod
2000,
In this paper, we introduce the truncated primal-infeasible dual-feasible interior...
A polyhedral study of the asymmetric traveling salesman problem with time windows
A polyhedral study of the asymmetric traveling salesman problem with time windows
2000,
The asymmetric traveling salesman problem with time windows (ATSP-TW) is a basic model...
Efficient modeling of travel in networks with time-varying link speeds
Efficient modeling of travel in networks with time-varying link speeds
2000,
This paper investigates exact and approximate methods for estimating time-minimizing...
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
2000,
In this paper, we deal with a network design problem arising from the deployment of...
Heuristic and exact algorithms for scheduling aircraft landings
Heuristic and exact algorithms for scheduling aircraft landings
1999,
The problem of scheduling aircraft landings on one or more runways is an interesting...
Graphs with given connectivity properties
Graphs with given connectivity properties
1997,
A node of a graph G , thought of as representing a communication network, is said to...
Tools for studying paths and cycles in digraphs
Tools for studying paths and cycles in digraphs
1998,
The main goal of this work was to describe the basic elements constituting a...
Uniformly optimally reliable graphs
Uniformly optimally reliable graphs
1998,
A graph with n nodes and e edges, where the nodes are perfectly reliable and the edges...
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
1998,
Given is an undirected graph with positive or negative edge weights which represent a...
Approximating Steiner trees in graphs with restricted weights
Approximating Steiner trees in graphs with restricted weights
1998,
We analyze the approximation ratio for the average distance heuristic for the Steiner...
Papers per page: