Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements

DOI10.1016/S0304-0208(08)73470-4MaRDI QIDQ3923963zbMATH OpenFDO

Authors Michel Minoux

Publication date 1981

Published in North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-0208(08)73470-4

zbMATH Keywords

computational resultsconvergenceimplementationmax-flow min-cut theoremminimum cost networkmulticommodity requirementsnon-simultaneous multicommodity flow requirementsoptimum network flow synthesis problemsecurity constraintstelecommunication network management

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cited in

(14)

• Exact solution of multicommodity network optimization problems with general step cost functions
• A primal partitioning approach for single and non-simultaneous multicommodity flow problems
• A distributed method for optimal capacity reservation
• Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
• On the robustness of potential-based flow networks
• Single-commodity robust network design with finite and hose demand sets
• Single-commodity robust network design problem: complexity, instances and heuristic solutions
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Ein Verfahren zur Optimierung von Nachrichtenübertragungsnetzen mit Mehrwegeführung
• k-Partition-based facets of the network design problem
• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
• Survivable network design with demand uncertainty
• Distributionally robust joint chance-constrained approach for the stochastic survivable capacitated network design problem
• Joint chance-constrained survivable capacitated multi-commodity network design problem with demand uncertainty

This page was built for publication: Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3923963)