2 citations · 4 across the 2 of their papers we have counts for
2 papers
math.OC2012★ 2 cited
Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems
Thomas L. Magnanti, Dan Stratila
We introduce an algorithm design technique for a class of combinatorial optimization problems with concave costs. This technique yields a strongly polynomial primal-dual algorithm…
math.OC2012★ 2 cited
Separable Concave Optimization Approximately Equals Piecewise-Linear Optimization
Thomas L. Magnanti, Dan Stratila
We study the problem of minimizing a nonnegative separable concave function over a compact feasible set. We approximate this problem to within a factor of 1+epsilon by a piecewise-…