The train frequency compatibility problem (Q2328084): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128875418, #quickstatements; #temporary_batch_1726312983621
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Jorge Orestes Cerdeira / rank
Normal rank
 
Property / author
 
Property / author: Carlos A. Iglesias / rank
Normal rank
 
Property / author
 
Property / author: Jorge Orestes Cerdeira / rank
 
Normal rank
Property / author
 
Property / author: Carlos A. Iglesias / 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.dam.2018.10.046 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2902361423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal schedules for periodically recurring events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line planning with user-optimal route choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling periodic events / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128875418 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:18, 14 September 2024

scientific article
Language Label Description Also known as
English
The train frequency compatibility problem
scientific article

    Statements

    The train frequency compatibility problem (English)
    0 references
    0 references
    0 references
    0 references
    9 October 2019
    0 references
    optimization
    0 references
    mixed integer linear programming
    0 references
    computational complexity
    0 references

    Identifiers