Method of characteristic functions for classes of networks with fixed node degrees

DOI10.1134/S1064230714050128zbMath1339.90326OpenAlexW2083429305MaRDI QIDQ2017647

P. S. Selin, Vladimir I. Tsurkov

Publication date: 23 March 2015

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

Full work available at URL: https://doi.org/10.1134/s1064230714050128

zbMATH Keywords

characteristic functionsflows in networkssum of arc weights

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted graphs with fixed vertex degrees and network flows
• Minimax in transportation models with integral constraints. I
• Transport-type problems with a minimax criterion
• Minimax under transportation constraints
• Approximation and decomposition by extremal graphs
• Transportation problems with a minimax criterion
• A triplanar transportation problem with a minimax criterion
• A minimax under nonlinear transportation constraints.
• Open transportation models with a minimax criterion.
• Closed transportation models with minimax criterion
• Network models with fixed parameters at the communication nodes. II
• Network models with fixed parameters at the communication nodes. I
• Transport and network problems with the minimax criterion
• Method of partition of networks with fixed degrees of nodes and network flows
• Minimax in transportation models with integral constraints. II

This page was built for publication: Method of characteristic functions for classes of networks with fixed node degrees