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
  • Implementing primal-dual netwo...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Implementing primal-dual network flow algorithms

Implementing primal-dual network flow algorithms

"Most of the results of this report were presented at the National ORSA/TIMS meeting, Chicago, May 1975." "7-113-77." Cover title.

Bibliographic Details
Other Authors: Aashtiani, Hedayat Zokaei
Language:eng
Published: Massachusetts Institute of Technology, Operations Research Center 2004
Subjects:
Q175.M41 O616 no.055-, 76
Online Access:http://hdl.handle.net/1721.1/5193
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

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

Similar Items

  • Multicommodity network flows : computational experience
    Published: (2004)
  • A faster strongly polynomial minimum cost flow algorithm
    Published: (2004)
  • Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
    Published: (2004)
  • Deterministic network optimization : a bibliography
    Published: (2004)
  • Demand for library materials : an exercise in probability analysis
    Published: (2004)

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