Country: United States

Found 17049 papers in total
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...
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. 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...
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...
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...
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...
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...
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...
Hub network games
Hub network games
1998,
In hub communication networks, a certain subset of focal nodes (i.e., hubs) is fully...
Process network synthesis: Problem definition
Process network synthesis: Problem definition
1998,
Analyses of network problems have yielded mathematically and practically significant...
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...
A solution to the hub center problem via a single-relocation algorithm with tabu search
A solution to the hub center problem via a single-relocation algorithm with tabu search
2001,
Network designers for many transportation or telecommunication applications need to...
Modeling presentations at national conventions
Modeling presentations at national conventions
1997,
Organizing the presentations at professional meetings or society meetings is a chore...
Two-timescale algorithms for simulation optimization of hidden Markov models
Two-timescale algorithms for simulation optimization of hidden Markov models
2001,
We propose two finite difference two-timescale Simultaneous Perturbation Stochastic...
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...
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...
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...
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...
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...
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....
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...
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...
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...
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...
Papers per page: