scientific article
From MaRDI portal
Publication:3929516
zbMath0473.90036MaRDI QIDQ3929516
Charles Whitlock, Nicos Christofides
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveylarge-scale systemscommunication networksnetwork designpipelineminimum costnetwork synthesisconnectivity constraintselectricity supply networksprescribed vulnerability properties
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items
On perfectly two-edge connected graphs, The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs, The point-to-point connection problem - analysis and algorithms, A bootstrap heuristic for designing minimum cost survivable networks, On the dominant of the Steiner 2-edge connected subgraph polytope, On the Steiner 2-edge connected subgraph polytope, Minimum-weight two-connected spanning networks, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, \(k\)-edge connected polyhedra on series-parallel graphs, Critical extreme points of the 2-edge connected spanning subgraph polytope, Directed Steiner problems with connectivity constraints, Generalized Steiner problem in outerplanar networks
