The out‐of‐kilter algorithm for solving network problems

DOI10.1080/0020739960270313MaRDI QIDQ4359664zbMATH OpenOpenAlexFDO

Authors Warwick J. Comley

Publication date 20 October 1997

Published in International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020739960270313

zbMATH Keywords

assignmentlinear networkout-of-kilter algorithmcapacitated flows

Mathematics Subject Classification ID

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

Recommendations

• An ϵ-Out-of-Kilter Method for Monotropic Programming
• A new polynomial-time implementation of the out-of-kilter algorithm using Minty's lemma
• The out-of-kilter algorithm applied to traffic congestion
• A scaling out-of-kilter algorithm for minimum cost flow
• scientific article; zbMATH DE number 150473

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3791941 (Why is no real title available?)
• scientific article; zbMATH DE number 53116 (Why is no real title available?)
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• Monotone networks
• The practical conversion of linear programmes to network flow models

Cited in

(3)

• A new polynomial-time implementation of the out-of-kilter algorithm using Minty's lemma
• An ϵ-Out-of-Kilter Method for Monotropic Programming
• The out-of-kilter algorithm applied to traffic congestion

This page was built for publication: The out‐of‐kilter algorithm for solving network problems

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