A faster version of the ASG algorithm

DOI10.1016/0893-9659(94)90066-3zbMATH Open0820.90039OpenAlexW2056446723MaRDI QIDQ1343522FDOQ1343522

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

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)

Cites Work

• Title not available (Why is that?)
• 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)

• Some properties of the alternating separation (AS) and ASAP algorithm
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• An O(2^0.304n) Algorithm for Solving Maximum Independent Set Problem 👍 👎
• Efficient generalized conjugate gradient algorithms. II: Implementation 👍 👎
• Dominant speed factors of active set methods for fast MPC 👍 👎
• A more effective version of algorithm A 👍 👎

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)