scientific article; zbMATH DE number 1535630
From MaRDI portal
Publication:4515976
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)
Recommendations
Cited in
(14)- A branch-and-cut algorithm for two-level survivable network design problems
- Two-connected networks with rings of bounded cardinality
- Optimal capacitated ring trees
- Designing survivable networks with zero-suppressed binary decision diagrams
- Exact algorithms for bi-objective ring tree problems with reliability measures
- Risk approaches for delivering disaster relief supplies
- Polyhedral approaches to the design of survivable networks
- Circular and radial design comparison of survivability in asymmetrical hierarchical networks
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- Telecommunications network design: Technology impacts and future directions
- Design of Survivable Networks: A survey
- Ring network design
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
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)
