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:"Strongly polynomial time"
Narrow search

Narrow search

Year of publication
Subject
All
shortest paths 1 strongly polynomial time algorithm 1 submodular flow 1
Online availability
All
Free 1
Type of publication
All
Book / Working Paper 1
Language
All
Undetermined 1
Author
All
FLEISCHER, Lisa 1 IWATA, Satoru 1 McCORMICK, Thomas 1
Institution
All
Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain 1
Published in...
All
CORE Discussion Papers 1
Source
All
RePEc 1
Showing 1 - 1 of 1
Cover Image
A faster capacity scaling algorithm for minimum cost submodular flow
FLEISCHER, Lisa; IWATA, Satoru; McCORMICK, Thomas - Center for Operations Research and Econometrics (CORE), … - 1999
We describe an O(n[exp.4]h min{log U, n[exp.2] log n}) capacity scaling algorithm for the minimum cost submodular flow problem.Our algorithm modifies and extends the Edmonds-Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification...
Persistent link: https://www.econbiz.de/10005043573
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...