On solving multi-type railway line planning problems (Q2569037): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2004.04.036 / rank
Normal rank
 
Property / author
 
Property / author: Stan P. M. van Hoesel / rank
 
Normal rank
Property / author
 
Property / author: Leo G. Kroon / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010674343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for railway crew management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost optimal allocation of rail passenger lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dispatching Buses in Parking Depots / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving multi-type railway line planning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2759914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulation of railway rolling stock: a branch-and-price approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4280134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time dispatch of trams in storage yards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing trains through a railway station based on a node packing model / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2004.04.036 / rank
 
Normal rank

Latest revision as of 07:05, 19 December 2024

scientific article
Language Label Description Also known as
English
On solving multi-type railway line planning problems
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references