Skip to content
VuFind
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
    • 日本語
    • Nederlands
    • Português
    • Português (Brasil)
    • 中文(简体)
    • 中文(繁體)
    • Türkçe
    • עברית
    • Gaeilge
    • Cymraeg
    • Ελληνικά
    • Català
    • Euskara
    • Русский
    • Čeština
    • Suomi
    • Svenska
    • polski
    • Dansk
    • slovenščina
    • اللغة العربية
    • বাংলা
    • Galego
    • Tiếng Việt
    • Hrvatski
    • हिंदी
    • Հայերէն
    • Українська
    • Sámegiella
    • Монгол
Advanced
  • Improved primal simplex algori...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems

Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems

"November 1988."

Bibliographic Details
Other Authors: Ahuja, Ravindra K., 1956-
Language:eng
Published: Massachusetts Institute of Technology, Operations Research Center 2004
Online Access:http://hdl.handle.net/1721.1/5080
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

http://hdl.handle.net/1721.1/5080

Similar Items

  • Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems
    by: Ahuja, Ravindra K., et al.
    Published: (2009)
  • A polynomial time primal network simplex algorithm for minimum cost flows
    Published: (2003)
  • An auction/sequential shortest path algorithm for the minimum cost network flow problem
    Published: (2003)
  • Equivalence of primal and dual simplex algorithms for the maximum flow problem
    Published: (2003)
  • Random assignment and shortest path problems
    by: Johan Wästlund
    Published: (2006-01-01)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs