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

A problems of selecting a optimal path on network

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

zbMATH Open1174.90868MaRDI QIDQ3609329FDOQ3609329


Authors: Lin Liu Edit this on Wikidata


Publication date: 6 March 2009





Recommendations

  • The problems of selecting an optimal path on network
  • Minisum amd minimax paths of a moving facility on a network
  • Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations
  • scientific article; zbMATH DE number 792650
  • scientific article; zbMATH DE number 1766757


zbMATH Keywords

polynomial algorithmnetwork locationalgorithms and complexitypoint-path distance


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)



Cited In (9)

  • Title not available (Why is that?)
  • The problems of selecting an optimal path on network
  • Optimization algorithms for resilient path selection in networks
  • The 2-path network problem
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Path problems in networks
  • Path Problems in Complex Networks
  • Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations





This page was built for publication: A problems of selecting a optimal path on network

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

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