A polynomial dual simplex algorithm fot the generalized circulation problem.

DOI10.1007/S101070100248MaRDI QIDQ5957566zbMATH OpenOpenAlexFDO

Authors Donald Goldfarb, Zhiying Jin, Yiqing Lin

Publication date 2002

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

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

zbMATH Keywords

arc excessexcess scalinggeneralized circulationgeneralized maximum flownetwork flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
• A new strongly polynomial dual network simplex algorithm
• A polynomial-time simplex method for the maximum \(k\)-flow problem
• A strongly polynomial minimum cost circulation algorithm
• New algorithms for generalized network flows

Cited in

(10)

• A strongly polynomial algorithm for generalized flow maximization
• Combinatorial Algorithms for the Generalized Circulation Problem
• A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM
• scientific article; zbMATH DE number 4057295 (Why is no real title available?)
• Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
• A Faster Combinatorial Algorithm for the Generalized Circulation Problem
• Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
• A simple GAP-canceling algorithm for the generalized maximum flow problem
• Shortest path and maximum flow problems in networks with additive losses and gains
• A polynomial-time simplex method for the maximum \(k\)-flow problem

This page was built for publication: A polynomial dual simplex algorithm fot the generalized circulation problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957566)