Design of a railway scheduling model for dense services (Q1024087): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PESPLib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039435134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed point operator for the generalised maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations Research in passenger railway transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodic Timetable Optimization in Public Transport / 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: Routing trains through a railway station based on a node packing model / 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 16:39, 1 July 2024

scientific article
Language Label Description Also known as
English
Design of a railway scheduling model for dense services
scientific article

    Statements

    Design of a railway scheduling model for dense services (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 June 2009
    0 references
    0 references
    timetable
    0 references
    railway network decomposition
    0 references
    conflict-free scheduling
    0 references
    time discretisation
    0 references
    itinerary reduction
    0 references
    independent set problem
    0 references
    fixed point iteration heuristic
    0 references
    0 references