The decomposition problem for the set of paths in a directed graph and its application

DOI10.1134/S000511791812010XzbMath1407.05105OpenAlexW4242985607MaRDI QIDQ1735230

D. N. Gainanov, V. A. Rasskazova, A. I. Kibzun

Publication date: 28 March 2019

Published in: Automation and Remote Control (Search for Journal in Brave)

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

zbMATH Keywords

algorithmdecompositiondirected graphstrongly connected graphlocomotive assignment

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Traffic problems in operations research (90B20) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On sufficient optimality conditions for a guaranteed control in the speed problem for a linear time-varying discrete-time system with bounded control ⋮ Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section

Cites Work

• Modelling railway freight traffic using the methods of graph theory and combinatorial optimization
• Stochastic optimization model of locomotive assignment to freight trains
• An Inference Algorithm for Monotone Boolean Functions Associated with Undirected Graphs
• Algorithm and Software Development to Allocate Locomotives for Transportation of Freight Trains
• The locomotive assignment problem: a survey on optimization models
• Combinatorial optimization. Theory and algorithms.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The decomposition problem for the set of paths in a directed graph and its application