Nominal and robust train timetabling problems (Q1926692): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Railway Timetabling Using Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2917369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete optimization in public rail transport / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach to train timetabling on a corridor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast heuristic for the train scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Train Timetabling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3523238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian heuristic algorithm for a real-world train timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Model, Algorithms and Strategy for Train Pathing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2917363 / 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: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic techniques for single line train scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations Research in passenger railway transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing delay resistant railway timetables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost optimal periodic train scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm approach to periodic railway synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2759921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bicriteria Approach for Robust Timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Model for Periodic Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Genetic Algorithm for Railway Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developing railway timetables which guarantee a better service / rank
 
Normal rank

Latest revision as of 01:27, 6 July 2024

scientific article
Language Label Description Also known as
English
Nominal and robust train timetabling problems
scientific article

    Statements

    Nominal and robust train timetabling problems (English)
    0 references
    0 references
    0 references
    29 December 2012
    0 references
    0 references
    train timetabling
    0 references
    transportation
    0 references
    cyclic and non-cyclic timetabling
    0 references
    nominal and robust problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references