The intractability of the reliable assignment problem in split networks

DOI10.1002/NET.3230260402zbMATH Open0856.90052OpenAlexW2021695439MaRDI QIDQ4894855FDOQ4894855

Authors: C. Stivaros, K. Sutner 

Publication date: 3 February 1997

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230260402

Recommendations

• Computing optimal assignments for residual network reliability
• The Complexity of the Residual Node Connectedness Reliability Problem
• Publication:4862892
• Computing residual connectedness reliability for restricted networks

zbMATH Keywords

assignment problemthreshold networkssplit networksresidual network reliability

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Communication networks in operations research (90B18)

Cites Work

• Title not available (Why is that?)
• Computing optimal assignments for residual network reliability

Cited In (3)

• Title not available (Why is that?)
• Complexity of Network Reliability and Optimal Resource Placement Problems
• Network reliability: Heading out on the highway

This page was built for publication: The intractability of the reliable assignment problem in split networks

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