Country: United States

Found 17049 papers in total
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...
Solving the all-pair shortest path query problem on interval and circular-arc graphs
Solving the all-pair shortest path query problem on interval and circular-arc graphs
1998,
In this paper, we study the following all-pair shortest path query problem: Given the...
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
1998,
In this paper, we examine complexity issues, models, and algorithms for the problem of...
The probabilistic longest path problem
The probabilistic longest path problem
1999,
We study the probabilistic longest path problem. We propose a modification strategy...
Upper and lower bounds for the average-case complexity of path-search
Upper and lower bounds for the average-case complexity of path-search
1999,
A channel graph is the union of all paths between a given input and a given output in...
Path problems in networks with vector-valued edge weights
Path problems in networks with vector-valued edge weights
1999,
We consider path problems in networks where each edge is associated with a vector of...
An efficient implementation of an algorithm for finding K shortest simple paths
An efficient implementation of an algorithm for finding K shortest simple paths
1999,
In this article, we present an efficient computational implementation of an algorithm...
On crossings, the crossing postman problem, and the rural postman problem
On crossings, the crossing postman problem, and the rural postman problem
1999,
The Rural Postman Problem (RPP), on an undirected network, is a classic edge-routing...
Quantitative Analysis: An Introduction
Quantitative Analysis: An Introduction
2001,
Performance of bucket brigades when work is stochastic
Performance of bucket brigades when work is stochastic
2001,
‘Bucket brigades’ are a way of sharing work on a flow line that results in...
The assignment problem with external interactions
The assignment problem with external interactions
1997,
The classical assignment problem matches n jobs to n machines in a way that minimizes...
Feasibility in transportation networks with supply eating arcs
Feasibility in transportation networks with supply eating arcs
1998,
In this paper, we consider a special case of a new type of mixed integer programming...
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
1998,
The tree knapsack problem (TKP) is a generalized 0–1 knapsack problem where all...
Inverse optimization
Inverse optimization
2001,
In this paper, we study inverse optimization problems defined as follows. Let S denote...
Multicriteria Decision Making: Advances in MCDM Models, Algorithms, Theory and Applications
Multicriteria Decision Making: Advances in MCDM Models, Algorithms, Theory and Applications
2001,
Papers per page: