Home > Search Results: A new strongly polynomial dual network simplex algorithm
  Search Tips
Advanced Search
Search collections:
Sort by: Display results: Output format:
Results overview: Found 1 records in 0.05 seconds.
Articles, 1 records found
Articles 1 records found  
1.
18 p, 973.6 KB A new strongly polynomial dual network simplex algorithm / Armstrong, Ronald D. ; Jin, Zhiying
This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly on the original capacitated network and runs in O(mn(m + n log n) log n) time for the network with n nodes and m arcs. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 131-148  
 UAB restricted access
Detailed record -

Interested in being notified about new results for this query?
Set up a personal email alert or subscribe to the RSS feed.
UAB Digital Repository of Documents :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.6
Maintained by ddd.bib@uab.cat  :: Metadata license:
Working with