A new polynomial-time implementation of the out-of-kilter algorithm using Minty's lemma

MaRDI QIDQ5501017zbMATH OpenFDO

Authors Mehdi Ghiyasvand

Publication date 10 August 2015

zbMATH Keywords

network flowsout-of-kilter algorithmMinty's lemmathe minimum cost flow problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06)

Recommendations

• A scaling out-of-kilter algorithm for minimum cost flow
• A scaling out-of-kilter algorithm for minimum cost flow in networks with positive lower bounds
• The out‐of‐kilter algorithm for solving network problems
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A polynomial time primal network simplex algorithm for minimum cost flows

Cited in

(2)

• A scaling out-of-kilter algorithm for minimum cost flow
• A scaling out-of-kilter algorithm for minimum cost flow in networks with positive lower bounds

This page was built for publication: A new polynomial-time implementation of the out-of-kilter algorithm using Minty's lemma

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