New algorithms for generalized network flows

This publication has 9 references indexed in Scilit:

• A Strongly Polynomial Algorithm for a Special Class of Linear Programs
  Operations Research, 1991
• Improved algorithms for linear inequalities with two variables per inequality
  Published by Association for Computing Machinery (ACM) ,1991
• Speeding-up linear programming using fast matrix multiplication
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
  Published by Defense Technical Information Center (DTIC) ,1988
• Combinatorial algorithms for the generalized circulation problem
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
  Operations Research, 1986
• Towards a Genuinely Polynomial Algorithm for Linear Programming
  SIAM Journal on Computing, 1983
• Generalized Networks: A Fundamental Computer-Based Planning Tool
  Management Science, 1978
• Polyhedral sets having a least element
  Mathematical Programming, 1972