A faster version of the ASG algorithm

DOI10.1016/0893-9659(94)90066-3MaRDI QIDQ1343522zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Dominant speed factors of active set methods for fast MPC
• scientific article; zbMATH DE number 724210
• An O(2^0.304n) Algorithm for Solving Maximum Independent Set Problem
• Efficient generalized conjugate gradient algorithms. II: Implementation
• A more effective version of algorithm A

Cites work

• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• A Newton method for convex separable network flow problems
• An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons
• An algorithm for solving quadratic network flow problems

Cited in

(2)

• scientific article; zbMATH DE number 2206640 (Why is no real title available?)
• Some properties of the alternating separation (AS) and ASAP algorithm

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

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