Results 1  10
of
1,845,218
A Note on Minimax Inverse Generalized Minimum Cost Flow Problems
"... Given a generalized network and a generalized feasible flow f 0, we consider a problem finding a modified edge cost d such that f 0 is minimum cost with respect to d and the maximum deviation between the original edge cost and d is minimum. This paper shows the relationship between this problem and ..."
Abstract
 Add to MetaCart
Given a generalized network and a generalized feasible flow f 0, we consider a problem finding a modified edge cost d such that f 0 is minimum cost with respect to d and the maximum deviation between the original edge cost and d is minimum. This paper shows the relationship between this problem
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
A POLYNOMIALTIME ALGORITHM FOR THE GENERALIZED INDEPENDENTFLOW PROBLEM
, 2002
"... Abstract We consider a compound problem of the generalized minimumcost flow problem and the independentflow problem, which we call the generalized independentflow problem. The generalized minimumcost flow problem is to find a minimumcost flow in a capacitated network with gains, where each arc ..."
Abstract
 Add to MetaCart
Abstract We consider a compound problem of the generalized minimumcost flow problem and the independentflow problem, which we call the generalized independentflow problem. The generalized minimumcost flow problem is to find a minimumcost flow in a capacitated network with gains, where each arc
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
 In Proceedings of the 31th Annual ACM Symposium on Theory of Computing
, 1999
"... We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and gains). Despite a rich history dating back to Kantorovich and Dantzig, until now, the only known way to solve the problem ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and gains). Despite a rich history dating back to Kantorovich and Dantzig, until now, the only known way to solve the problem
Parallel Algorithms for the Assignment and MinimumCost Flow Problems
"... Let G = (V; E) be a network for an assignment problem with 2n nodes and m edges, in which the largest edge cost is C. Recently the class of instances of bipartite matching problems has been shown to be in RNC provided that C is O(log k n) for some fixed k. We show how to use scaling so as to dev ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
as to develop an improved parallel algorithm and show that bipartite matching problems are in the class RNC provided that C = O(n log k n ) for some fixed k. We then generalize these results to minimumcost flow problems. Let U be an upper bound on the capacities of the edges and on the largest demand. We
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1961 (24 self)
 Add to MetaCart
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information
Optimization Flow Control, I: Basic Algorithm and Convergence
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract

Cited by 690 (64 self)
 Add to MetaCart
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm
Mining Generalized Association Rules
, 1995
"... We introduce the problem of mining generalized association rules. Given a large database of transactions, where each transaction consists of a set of items, and a taxonomy (isa hierarchy) on the items, we find associations between items at any level of the taxonomy. For example, given a taxonomy th ..."
Abstract

Cited by 577 (7 self)
 Add to MetaCart
We introduce the problem of mining generalized association rules. Given a large database of transactions, where each transaction consists of a set of items, and a taxonomy (isa hierarchy) on the items, we find associations between items at any level of the taxonomy. For example, given a taxonomy
A generalized processor sharing approach to flow control in integrated services networks: The singlenode case
 IEEE/ACM Transactions on Networking
, 1993
"... AbstruetThe problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuiq comectionbased packet network. We show that the use of Generalized processor Sharing (GPS), w ..."
Abstract

Cited by 2015 (5 self)
 Add to MetaCart
AbstruetThe problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuiq comectionbased packet network. We show that the use of Generalized processor Sharing (GPS
Results 1  10
of
1,845,218