The problem of synthesizing switching networks using the minimax criterion

zbMATH Open0808.90070MaRDI QIDQ1335871FDOQ1335871

Authors: A. Perevozchikov 

Publication date: 3 November 1994

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

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 4076934
• scientific article; zbMATH DE number 3914110
• Problem of linearly nonhomogeneous synthesis of multicommodity networks
• Statement of the problem of optimal resource allocation in stochastic networks with complex spatial temporal structure

zbMATH Keywords

resource distributionswitching network

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• General solutions to switching problems

This page was built for publication: The problem of synthesizing switching networks using the minimax criterion

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