New algorithms for generalized network flows

DOI10.1007/BF01582579zbMath0816.90057OpenAlexW1976073775MaRDI QIDQ1332311

Nimrod Megiddo, Edith Cohen

Publication date: 10 October 1994

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

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

zbMATH Keywords

generalized circulationgeneralized network flowstrongly polynomial approximation algorithmuncapacitated generalized transshipment

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

A Strongly Polynomial Algorithm for Generalized Flow Maximization ⋮ Monotonizing linear programs with up to two nonzeroes per column ⋮ An ε-Relaxation method for generalized separable convex cost network flow problems ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ Bimonotone linear inequalities and sublattices of \(\mathbb R^n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Speeding up Karmarkar's algorithm for multicommodity flows
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Towards a Genuinely Polynomial Algorithm for Linear Programming
• A Strongly Polynomial Algorithm for a Special Class of Linear Programs
• Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
• Polyhedral sets having a least element

This page was built for publication: New algorithms for generalized network flows