scientific article; zbMATH DE number 1535630

zbMATH Open0987.90017MaRDI QIDQ4515976FDOQ4515976

Authors: Bernard Fortz 

Publication date: 26 November 2000

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

Recommendations

• scientific article; zbMATH DE number 795223
• Design of survivable networks
• Polyhedral approaches to the design of survivable networks
• Ring network design
• scientific article; zbMATH DE number 176255

zbMATH Keywords

heuristicsnetwork optimizationtelecommunicationbranch-and-cut methods

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Communication networks in operations research (90B18)

Cited In (14)

• Circular and radial design comparison of survivability in asymmetrical hierarchical networks
• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
• Design of Survivable Networks: A survey
• Polyhedral approaches to the design of survivable networks
• Risk approaches for delivering disaster relief supplies
• Ring network design
• Optimal capacitated ring trees
• Telecommunications network design: Technology impacts and future directions
• Exact algorithms for bi-objective ring tree problems with reliability measures
• Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
• A branch-and-cut algorithm for two-level survivable network design problems
• Critical extreme points of the 2-edge connected spanning subgraph polytope
• Two-connected networks with rings of bounded cardinality
• Designing survivable networks with zero-suppressed binary decision diagrams

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