A MIP-based local search method for the railway rescheduling problem (Q3076018)

From MaRDI portal
Revision as of 23:20, 14 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A MIP-based local search method for the railway rescheduling problem
scientific article

    Statements

    title
    A MIP-based local search method for the railway rescheduling problem (English)
    0 references
    DOI
    10.1002/net.20384
    0 references
    author
    Dominique Feillet
    0 references
    Serigne Gueye
    0 references
    Rodrigo Acuna-Agost
    0 references
    published in
    Networks
    0 references
    publication date
    17 February 2011
    0 references
    Mathematics Subject Classification ID
    90B20
    0 references
    90B35
    0 references
    90C11
    0 references
    90B90
    0 references
    zbMATH DE Number
    5852397
    0 references
    zbMATH Keywords
    disruption management
    0 references
    rescheduling
    0 references
    train timetabling
    0 references
    local branching
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3076018&oldid=21249844"
    Powered by MediaWiki