Routing trains through railway stations: Complexity issues (Q1278725): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710434565540
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games of Boldness, Where the Player Performing the Hardest Task Wins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fixed Job Schedule Problem with Spread-Time Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fixed Job Schedule Problem with Working-Time Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Fixed Job Schedule Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Resources for Fixed and Variable Job Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Solution for the Channel-Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of (maximum) class scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: License class design: Complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of (maximum) shift class scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of shift class design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing Trains Through Railway Stations: Model Formulation and Algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(95)00342-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2125320823 / rank
 
Normal rank

Latest revision as of 10:54, 30 July 2024

scientific article
Language Label Description Also known as
English
Routing trains through railway stations: Complexity issues
scientific article

    Statements

    Routing trains through railway stations: Complexity issues (English)
    0 references
    0 references
    0 references
    0 references
    22 February 1999
    0 references
    railway transportation
    0 references
    timetabling
    0 references
    routing trains
    0 references

    Identifiers