EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"dual network simplex"
Narrow search

Narrow search

Year of publication
Subject
All
Minimum cost flow problem 2 cut cancelling 2 dual algorithms 2 dual network simplex 2 strongly polynomial algorithm 2
Online availability
All
Undetermined 2
Type of publication
All
Article 2
Language
All
Undetermined 2
Author
All
Vygen, Jens 2
Published in...
All
Computational Statistics 1 Mathematical Methods of Operations Research 1
Source
All
RePEc 2
Showing 1 - 2 of 2
Cover Image
On dual minimum cost flow algorithms
Vygen, Jens - In: Computational Statistics 56 (2002) 1, pp. 101-126
algorithms by a factor of m. On the other hand, our algorithm can be considered as a variant of the dual network simplex … algorithm. Although dual network simplex algorithms are reportedly quite efficient in practice, the best worst-case running time …
Persistent link: https://www.econbiz.de/10010847877
Saved in:
Cover Image
On dual minimum cost flow algorithms
Vygen, Jens - In: Mathematical Methods of Operations Research 56 (2002) 1, pp. 101-126
algorithms by a factor of m. On the other hand, our algorithm can be considered as a variant of the dual network simplex … algorithm. Although dual network simplex algorithms are reportedly quite efficient in practice, the best worst-case running time …
Persistent link: https://www.econbiz.de/10010999883
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...