Efficiency of algorithms for solution of network problems with tree-like data structure

DOI10.1023/A:1025726030861MaRDI QIDQ2487904zbMATH OpenOpenAlexFDO

Authors F. A. Sharifov

Publication date 12 August 2005

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1025726030861

zbMATH Keywords

network problemssimplex algorithmsefficiency of algorithmstree-like data structures

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Extreme-point and pivoting methods (90C49)

Cited in

(3)

• Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
• Two Matching Based Algorithm for Tree Network Design
• Algorithm to solve a discrete minimax problem of the arrangement of physical field sources

This page was built for publication: Efficiency of algorithms for solution of network problems with tree-like data structure

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