Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
From MaRDI portal
Publication:3923963
DOI10.1016/S0304-0208(08)73470-4zbMath0469.90080MaRDI QIDQ3923963
Publication date: 1981
Published in: North-Holland Mathematics Studies (Search for Journal in Brave)
convergencecomputational resultsimplementationmax-flow min-cut theoremsecurity constraintsminimum cost networkmulticommodity requirementsnon-simultaneous multicommodity flow requirementsoptimum network flow synthesis problemtelecommunication network management
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)
Related Items (12)
Ein Verfahren zur Optimierung von Nachrichtenübertragungsnetzen mit Mehrwegeführung ⋮ Single-commodity robust network design with finite and hose demand sets ⋮ Single-commodity robust network design problem: complexity, instances and heuristic solutions ⋮ Survivable network design with demand uncertainty ⋮ On the robustness of potential-based flow networks ⋮ Networks synthesis and optimum network design problems: Models, solution methods and applications ⋮ Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements ⋮ k-Partition-based facets of the network design problem ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité ⋮ A primal partitioning approach for single and non-simultaneous multicommodity flow problems ⋮ A distributed method for optimal capacity reservation ⋮ Exact solution of multicommodity network optimization problems with general step cost functions
This page was built for publication: Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
