T. R. Ervolina and S. T. McCormick. Two strongly polynomial cut cancelling algorithms for minimum cost network flow. Disc. Appl. Math. 46 (1993) 133--165. 14 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Choosing Subsets with Maximum Weighted Average - Eppstein, Hirschberg (1997) (Correct)
....Some similar problems have been studied before, but we were unable to find any reference to the minimum weighted average subset problem. Algorithms for finding a cycle or cut in a graph minimizing the mean of the edge costs [12, 13, 14, 24] have been used as part of algorithms for network flow [9, 11, 21] and cyclic sta#ng [16] but the averages used in these problems do not typically involve weights. More recently, Bern et al. 2] have investigated problems of finding the possible weighted averages of a point set in which the weight of each point may vary in a certain range. However that work ....
T. R. Ervolina and S. T. McCormick. Two strongly polynomial cut cancelling algorithms for minimum cost network flow. Disc. Appl. Math. 46 (1993) 133--165. 14
Choosing Subsets with Maximum Weighted Average - Eppstein, Hirschberg (1995) (Correct)
....Some similar problems have been studied before, but we were unable to find any reference to the minimum weighted average subset problem. Algorithms for finding a cycle or cut in a graph minimizing the mean of the edge costs [12, 13, 15, 27] have been used as part of algorithms for network flow [8, 11, 24] and cyclic sta#ng [17] however the averages used in these problems do not typically involve weights. More recently, Bern et al. 2] have investigated problems of finding the possible weighted averages of a point set in which the weight of each point may vary in a certain range. However that work ....
T. R. Ervolina and S. T. McCormick. Two strongly polynomial cut cancelling algorithms for minimum cost network flow. Disc. Appl. Math. 46 (1993) 133--165.
Choosing Subsets with Maximum Weighted Average - Eppstein, Hirschberg (1995) (Correct)
....Some similar problems have been studied before, but we were unable to find any reference to the minimum weighted average subset problem. Algorithms for finding a cycle or cut in a graph minimizing the mean of the edge costs [12, 13, 15, 27] have been used as part of algorithms for network flow [8, 11, 24] and cyclic staffing [17] however the averages used in these problems do not typically involve weights. More recently, Bern et al. 2] have investigated problems of finding the possible weighted averages of a point set in which the weight of each point may vary in a certain range. However that ....
T. R. Ervolina and S. T. McCormick. Two strongly polynomial cut cancelling algorithms for minimum cost network flow. Disc. Appl. Math. 46 (1993) 133--165.
Choosing Subsets with Maximum Weighted Average - Eppstein, Hirschberg (1995) (Correct)
....Some similar problems have been studied before, but we were unable to find any reference to the minimum weighted average subset problem. Algorithms for finding a cycle or cut in a graph minimizing the mean of the edge costs [12, 13, 14, 24] have been used as part of algorithms for network flow [9, 11, 21] and cyclic staffing [16] but the averages used in these problems do not typically involve weights. More recently, Bern et al. 2] have investigated problems of finding the possible weighted averages of a point set in which the weight of each point may vary in a certain range. However that work ....
T. R. Ervolina and S. T. McCormick. Two strongly polynomial cut cancelling algorithms for minimum cost network flow. Disc. Appl. Math. 46 (1993) 133--165.
Polynomial Methods For Separable Convex Optimization In.. - Karzanov, McCormick (1997) (4 citations) Self-citation (Mccormick) (Correct)
....## e # Fig. 2. The arc objective function for the classic linear cocirculation problem with lower bound l e , upper bound ue , and cost ce . and Tarjan [5] Its ideas inspired a number of polynomial and strongly polynomial algorithms for other problems, such as the linear cocirculation problem [2], determining the Euclidean distances to certain polyhedra [4, 12] and the min cost cocirculation (tension) problem [7] However, it appears that it does not work well for submodular flow problems; see [20] The first purpose of the present paper is to show that the minimum mean canceling ....
....and has geometric dual convergence in terms of the # 1 distance of the current vector of partial (left and right) derivatives to an optimal dual vector. There is a faster version of the minimum mean cycle canceling method for the linear circulation problem, the cancel and tighten method [5, 2]. We show that this also can be generalized to our generic case to give a method whose dual convergence is at essentially the same geometric rate but which has much faster iterations than our first method. This paper considers several specializations and two generalizations of our general model by ....
[Article contains additional citation context not shown here]
<F4.08e+05> T. R. Ervolina and S. T.<F4.039e+05> McCormick,<F4.112e+05> Two strongly polynomial cut cancelling algorithms for minimum cost network<F4.039e+05> flow, Discrete Appl. Math, 46 (1993), pp. 133--165.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC