Optimal allocation of buffer times to increase train schedule robustness (Q1752165): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q228573
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Nebojša J. Bojović / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniZinc / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2356436688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining operations affected by delay in predictive train timetables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective models and techniques for analysing the absolute capacity of railway networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A disjunctive graph model and framework for constructing new train schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with the “Oregon Trail Knapsack Problem” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal and robust train timetabling problems / 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: Recoverable Robust Timetables: An Algorithmic Approach on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multidimensional 0-1 knapsack problem: an overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple attribute decision making. Methods and applications. A state-of- the-art survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of railway networks with single track operation using the UIC 406 capacity method / 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: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing Efficiency and Robustness – A Bi-criteria Optimization Approach to Railway Track Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: MiniZinc with Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developing railway timetables which guarantee a better service / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability and heterogeneity of railway services / rank
 
Normal rank

Latest revision as of 17:10, 15 July 2024

scientific article
Language Label Description Also known as
English
Optimal allocation of buffer times to increase train schedule robustness
scientific article

    Statements

    Optimal allocation of buffer times to increase train schedule robustness (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    buffer times
    0 references
    capacity
    0 references
    knapsack problem
    0 references
    timetable robustness
    0 references

    Identifiers

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