A faster version of the ASG algorithm

N. L. Boland, A. T. Ernst, C. J. Goh, A. I. Mees

Research output: Contribution to journalArticleResearchpeer-review


We present a more efficient version of the Active-Set-on-a-Graph (ASG) algorithm described in an earlier letter [1].

Original languageEnglish
Pages (from-to)23-27
Number of pages5
JournalApplied Mathematics Letters
Issue number5
Publication statusPublished - 1994
Externally publishedYes


  • Active set methods
  • Network optimization
  • Nonlinear optimization
  • Optimal control problems
  • Original and relaxed controls
  • Proper relaxation procedures
  • Systems with time delays
  • Two-commodity flow.

Cite this