Metric inequalities for routings on direct connections with application to line planning (Q1751129): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Planning Problems in Public Transit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal lines for railway systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete optimization in public rail transport / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line Planning with Minimal Traveling Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Network Line Planning and Traffic Assignment. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Connection Approach to Integrated Line Planning and Passenger Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525436 / rank
 
Normal rank

Latest revision as of 17:05, 15 July 2024

scientific article
Language Label Description Also known as
English
Metric inequalities for routings on direct connections with application to line planning
scientific article

    Statements

    Metric inequalities for routings on direct connections with application to line planning (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    line planning
    0 references
    transfers
    0 references
    direct connection
    0 references
    metric inequalities
    0 references
    0 references
    0 references
    0 references

    Identifiers

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