A faster version of the ASG algorithm

DOI10.1016/0893-9659(94)90066-3zbMath0820.90039OpenAlexW2056446723MaRDI QIDQ1343522

C. J. Goh, Alistair I. Mees, Andreas T. Ernst, Natashia Boland

Publication date: 14 September 1995

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

Full work available at URL: https://doi.org/10.1016/0893-9659(94)90066-3

zbMATH Keywords

optimal controlnetwork optimizationsystems with time delaysproper relaxationActive-Set-on-Graphtwo- commodity flow

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• An algorithm for solving quadratic network flow problems
• A Newton method for convex separable network flow problems
• An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons

This page was built for publication: A faster version of the ASG algorithm