Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3302127

From MaRDI portal
Publication:5583697
Jump to:navigation, search

zbMATH Open0189.24104MaRDI QIDQ5583697FDOQ5583697


Authors: G. B. Datzig Edit this on Wikidata


Publication date: 1967



Title of this publication is not available (Why is that?)




zbMATH Keywords

topology



Cited In (7)

  • Two fast algorithms for all-pairs shortest paths
  • CLOUD computing risk management for server-farm repair rates, consumer load cycle, server-farm repair crew count, and additional servers
  • Finding the shortest paths by node combination
  • All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
  • On finding shortest paths in nonnegative networks
  • Allowable processing orders in the accelerated cascade algorithm
  • George Dantzig's impact on the theory of computation





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5583697)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5583697&oldid=30847425"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 March 2024, at 15:07. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki