The out‐of‐kilter algorithm for solving network problems

DOI10.1080/0020739960270313zbMATH Open0898.90055OpenAlexW2079319836MaRDI QIDQ4359664FDOQ4359664

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

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

zbMATH Keywords

assignmentlinear networkout-of-kilter algorithmcapacitated flows

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Monotone networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• The practical conversion of linear programmes to network flow models

Cited In (3)

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

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)