Categories and Subject Descriptors: F.2.0 [Analysis of Algorithms and Problem Complexity]; G.2.2 [Discrete Mathematics]: Graph Theory -- network problems
General Terms: Algorithms, Decision, Theory
Additional Key Words and Phrases: Nonlinear optimization, proximity results, scaling algorithms
Selected papers that cite this one
- F. Granot, J. Skorin-Kapov, and A. Tamir. Using quadratic programming to solve high multiplicity scheduling problems on parallel machines. Algorithmica, 17(2):100-110, February 1997.
- Alexander V. Karzanov and S. Thomas McCormick. Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM Journal on Computing, 26(4):1245-1275, August 1997.
- Jack Edmonds and Richard M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2):248-264, April 1972.