scientific article; zbMATH DE number 4112358

MaRDI QIDQ3835265zbMATH OpenFDO

Authors O. A. Kosorukov

Publication date 1988

zbMATH Keywords

communication networkscovering forestDantzig-Wolfe decompositionmaximum flowminimum cut

Mathematics Subject Classification ID

Decomposition methods (49M27) Deterministic network models in operations research (90B10) Linear programming (90C05) Applications of mathematical programming (90C90) Synthesis problems (93B50)

Recommendations

• Algorithm of the method of generalized potentials for problems of the optimum synthesis of communication networks with undefined factors
• scientific article; zbMATH DE number 4045458
• Algorithm of the generalized method of potentials for the problem of optimal linear synthesis of a communication network
• Some aspects of nonlinear synthesis of communications networks
• Publication:3484606

Cited in

(4)

• Algorithm of the method of generalized potentials for problems of the optimum synthesis of communication networks with undefined factors
• Algorithm of the generalized method of potentials for the problem of optimal linear synthesis of a communication network
• scientific article; zbMATH DE number 3922709 (Why is no real title available?)
• The decomposition of a communication network considering traffic demand interrelations

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 Q3835265)