\(k\)-shortest routing of trains on shunting yards (Q841591): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00291-008-0140-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067295650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling railway traffic at a construction site / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Optimization Models for Train Routing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the k Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integrated dispatching model for rail yards operations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4008496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc tolerances in shortest path and network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative methods for determining the k shortest paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the \(k\)-best traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing Trains Through Railway Stations: Model Formulation and Algorithms / rank
 
Normal rank

Latest revision as of 00:10, 2 July 2024

scientific article
Language Label Description Also known as
English
\(k\)-shortest routing of trains on shunting yards
scientific article

    Statements

    \(k\)-shortest routing of trains on shunting yards (English)
    0 references
    0 references
    0 references
    0 references
    18 September 2009
    0 references
    0 references
    \(k\)-shortest path
    0 references
    Hamiltonian path
    0 references
    shunting scheduling
    0 references
    railway planning
    0 references
    0 references