Journal: Networks

Found 487 papers in total
A note on the bottleneck graph partition problem
A note on the bottleneck graph partition problem
1999,
The bottleneck graph partition problem consists of partitioning the vertices of an...
Optimal edge coloring of large graphs
Optimal edge coloring of large graphs
1999,
Most of the general families of large considered graphs in the context of the...
Analysis of LP relaxations for multiway and multicut problems
Analysis of LP relaxations for multiway and multicut problems
1999,
We introduce in this paper an exact nonlinear formulation of the multiway cut problem....
A tabu search heuristic for the Steiner tree problem
A tabu search heuristic for the Steiner tree problem
1999,
The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has...
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
1999,
As a metaheuristic to obtain solutions of enhanced quality, we formulate the so-called...
On Steiner centers and Steiner medians of graphs
On Steiner centers and Steiner medians of graphs
1999,
Let G be connected graph and S a set of vertices of G . Then a Steiner tree for S is a...
Center, median, and centroid subgraphs
Center, median, and centroid subgraphs
1999,
The median and centroid of an arbitrary graph G are two different generalizations of...
A branch and cut algorithm for the Steiner problem in graphs
A branch and cut algorithm for the Steiner problem in graphs
1998,
In this paper, we consider the Steiner problem in graphs, which is the problem of...
A strong lower bound for the node weighted Steiner tree problem
A strong lower bound for the node weighted Steiner tree problem
1998,
In this paper, we study the Node Weighted Steiner Tree Problem (NSP). This problem is...
Process network synthesis: Problem definition
Process network synthesis: Problem definition
1998,
Analyses of network problems have yielded mathematically and practically significant...
Hub network games
Hub network games
1998,
In hub communication networks, a certain subset of focal nodes (i.e., hubs) is fully...
How to test a tree
How to test a tree
1998,
We address the problem of verifying that a tree is connected using probe operations...
Solving Steiner tree problems in graphs to optimality
Solving Steiner tree problems in graphs to optimality
1998,
In this paper, we present the implementation of a branch-and-cut algorithm for solving...
Optimum requirement spanning trees and reliability of tree networks
Optimum requirement spanning trees and reliability of tree networks
1999,
In this paper, an explicit solution of the optimum requirement spanning tree, studied...
On a condition for obtaining an explicit solution of optimum requirement spanning tree
On a condition for obtaining an explicit solution of optimum requirement spanning tree
1999,
The optimum requirement spanning tree (ORST) studied by Hu is known to be obtained by...
An extended planar algorithm for maximum integral two-flow
An extended planar algorithm for maximum integral two-flow
1998,
Several problems, including the maximum integral two-flow problem, are known to be...
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms
1999,
We discuss a wide range of matching problems in terms of a network flow model. More...
Balanced network flows. II. Simple augmentation algorithms
Balanced network flows. II. Simple augmentation algorithms
1999,
In previous papers, we discussed the fundamental theory of matching problems and...
Balanced network flows. III. Strongly polynomial augmentation algorithms
Balanced network flows. III. Strongly polynomial augmentation algorithms
1999,
We discuss efficient augmentation algorithms for the maximum balanced flow problem...
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
1999,
In the minimum-cost strong network orientation problem (MCSO), we are given an...
Euclidean Steiner minimum trees: An improved exact algorithm
Euclidean Steiner minimum trees: An improved exact algorithm
1997,
The Euclidean Steiner tree problem asks for a shortest network interconnecting a set...
On capacitated stochastic chain problems in a network
On capacitated stochastic chain problems in a network
1998,
This paper considers two basic problems relating to capacitated chains in a stochastic...
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
1998,
This paper presents an optimal dynamic programming algorithm, the first such algorithm...
A new proximal decomposition algorithm for routing in telecommunication networks
A new proximal decomposition algorithm for routing in telecommunication networks
1998,
We present a new and much more efficient implementation of the proximal decomposition...
Papers per page: