Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases (Q1041435): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Robust optimization - a comprehensive survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2917368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delay Management Problem: Complexity Results and Robust Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization models for the single delay management problem in public transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank

Latest revision as of 05:30, 2 July 2024

scientific article
Language Label Description Also known as
English
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
scientific article

    Statements

    Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2009
    0 references
    timetable optimization
    0 references
    robust optimization
    0 references
    recoverable robustness
    0 references

    Identifiers