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 840685

From MaRDI portal
Jump to:navigation, search

zbMATH Open0838.90055MaRDI QIDQ4862892FDOQ4862892


Authors: C. Stivaros, K. Sutner Edit this on Wikidata


Publication date: 25 February 1996



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



Recommendations

  • Computing optimal assignments for residual network reliability
  • Reliability optimization of computer-communication networks
  • Combinatorial optimization problems in the analysis and design of probabilistic networks
  • The intractability of the reliable assignment problem in split networks
  • scientific article; zbMATH DE number 139921


zbMATH Keywords

sparse networksprobabilistic networksmulti-ringsoptimal link assignments


Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Discrete location and assignment (90B80)



Cited In (4)

  • Reliability optimization of computer-communication networks
  • Title not available (Why is that?)
  • A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
  • Exact reliability optimization for series‐parallel graphs using convex envelopes





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 Q4862892)

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