An algorithm for solving quadratic network flow problems

DOI10.1016/0893-9659(91)90056-2zbMath0746.90017OpenAlexW1987025590WikidataQ126867932 ScholiaQ126867932MaRDI QIDQ1175149

C. J. Goh, Natashia Boland, Alistair I. Mees

Publication date: 25 June 1992

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(91)90056-2

zbMATH Keywords

minimum cost flowactive set strategyconvex simplex algorithmnetwork quadratic problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A faster version of the ASG algorithm, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Network flow, transportation and scheduling. Theory and algorithms
• Dioïds and semirings: Links to fuzzy sets and other applications
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A scaled reduced gradient algorithm for network flow problems with convex separable costs