Speeding up Karmarkar's algorithm for multicommodity flows

DOI10.1007/BF02592100zbMath0848.90056OpenAlexW2059630705MaRDI QIDQ1915810

Sanjiv Kapoor, Pravin M. Vaidya

Publication date: 13 October 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592100

zbMATH Keywords

multicommodity flowsinterior point algorithmKarmarkar's linear programming algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (6)

New algorithms for generalized network flows ⋮ Improving time bounds on maximum generalised flow computations by contracting the network ⋮ A Strongly Polynomial Algorithm for Generalized Flow Maximization ⋮ Unnamed Item ⋮ Optimal Multicommodity Flow Through the Complete Graph with Random Edge Capacities ⋮ Exploiting special structure in a primal-dual path-following algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming

This page was built for publication: Speeding up Karmarkar's algorithm for multicommodity flows