Routing trains through a railway station based on a node packing model (Q1592731): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing trains through railway stations: Complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing / 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: A Mathematical Model for Periodic Scheduling Problems / 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(00)00087-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029372500 / rank
 
Normal rank

Latest revision as of 10:01, 30 July 2024

scientific article
Language Label Description Also known as
English
Routing trains through a railway station based on a node packing model
scientific article

    Statements

    Routing trains through a railway station based on a node packing model (English)
    0 references
    0 references
    0 references
    0 references
    11 April 2002
    0 references
    railway transportation
    0 references
    timetabling
    0 references
    routing trains
    0 references
    node packing problem
    0 references
    branch-and-cut
    0 references
    0 references
    0 references

    Identifiers

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