Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints

This publication has 13 references indexed in Scilit:

• Fast approximation algorithms for fractional packing and covering problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• A Fast Parametric Maximum Flow Algorithm and Applications
  SIAM Journal on Computing, 1989
• An O(n) algorithm for quadratic knapsack problems
  Operations Research Letters, 1984
• The flow deviation method: An approach to store‐and‐forward communication network design
  Networks, 1973
• A partitioning algorithm for the multicommodity network flow problem
  Mathematical Programming, 1972
• Primal partition programming for block diagonal matrices
  Numerische Mathematik, 1964
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
  Operations Research, 1963
• The Decomposition Algorithm for Linear Programs
  Econometrica, 1961
• An algorithm for quadratic programming
  Naval Research Logistics Quarterly, 1956
• An Iterative Method of Solving a Game
  Annals of Mathematics, 1951