scientific article; zbMATH DE number 1535630
From MaRDI portal
Publication:4515976
zbMath0987.90017MaRDI QIDQ4515976
Publication date: 26 November 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (6)
Optimal capacitated ring trees ⋮ Design of Survivable Networks: A survey ⋮ Telecommunications network design: Technology impacts and future directions ⋮ Risk approaches for delivering disaster relief supplies ⋮ Critical extreme points of the 2-edge connected spanning subgraph polytope ⋮ Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
This page was built for publication:
