New algorithms for generalized network flows
- 1 March 1994
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 64 (1-3) , 325-336
- https://doi.org/10.1007/bf01582579
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Speeding up Karmarkar's algorithm for multicommodity flowsMathematical Programming, 1996
- Improved Algorithms For Linear Inequalities with Two Variables Per InequalitySIAM Journal on Computing, 1994
- A Strongly Polynomial Algorithm for a Special Class of Linear ProgramsOperations Research, 1991
- Speeding-up linear programming using fast matrix multiplicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear ProgramsOperations Research, 1986
- Towards a Genuinely Polynomial Algorithm for Linear ProgrammingSIAM Journal on Computing, 1983
- Generalized Networks: A Fundamental Computer-Based Planning ToolManagement Science, 1978
- Polyhedral sets having a least elementMathematical Programming, 1972