Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
- 1 February 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 4 (1), 86-107
- https://doi.org/10.1137/0804004
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Fast approximation algorithms for fractional packing and covering problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- An O(n) algorithm for quadratic knapsack problemsOperations Research Letters, 1984
- The flow deviation method: An approach to store‐and‐forward communication network designNetworks, 1973
- A partitioning algorithm for the multicommodity network flow problemMathematical Programming, 1972
- Primal partition programming for block diagonal matricesNumerische Mathematik, 1964
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963
- The Decomposition Algorithm for Linear ProgramsEconometrica, 1961
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956
- An Iterative Method of Solving a GameAnnals of Mathematics, 1951