Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section

DOI10.1134/S0005117921050040zbMath1466.90018OpenAlexW3166561756MaRDI QIDQ2034833

Yanyan Li

Publication date: 23 June 2021

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

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

zbMATH Keywords

graph modeloptimal assignment problemconstrained cover of graphminimal path cover of graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Optimization of simultaneous delivery and pickup wagon scheme on hybrid siding network of railway terminal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• The decomposition problem for the set of paths in a directed graph and its application
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• The problem of trains formation and scheduling: integer statements
• A note on Hamiltonian circuits
• Covering the vertices of a graph by vertex-disjoint paths
• Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization

This page was built for publication: Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section