메뉴 건너뛰기




Volumn 74, Issue 1, 2011, Pages 53-75

Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization

Author keywords

Competitive analysis; Delay management; Online optimization; Public transportation

Indexed keywords

A-TRAIN; COMPETITIVE ANALYSIS; COMPETITIVE RATIO; DELAY MANAGEMENT; DELAY MINIMIZATION; DETERMINISTIC ONLINE ALGORITHMS; GAME TREES; GERMAN NATIONAL RAILWAYS; LOWER BOUNDS; OBJECTIVE FUNCTIONS; ON-LINE ALGORITHMS; ONLINE OPTIMIZATION; ORIGINAL MODEL; PROFIT MAXIMIZATION; PUBLIC TRANSPORTATION; RANDOMIZED ALGORITHMS; TICKET PRICES;

EID: 80054963090     PISSN: 14322994     EISSN: 14325217     Source Type: Journal    
DOI: 10.1007/s00186-011-0349-2     Document Type: Article
Times cited : (14)

References (11)
  • 4
    • 49949092507 scopus 로고    scopus 로고
    • Decision support tools for customer-oriented dispatching
    • Biederbick C, Suhl L (2004) Decision support tools for customer-oriented dispatching. AlgorithmMethods Railw Optim LNCS 4359:171-183
    • (2004) AlgorithmMethods Railw Optim LNCS , vol.4359 , pp. 171-183
    • Biederbick, C.1    Suhl, L.2
  • 10
    • 18944406568 scopus 로고    scopus 로고
    • A model for the delay management problem based on mixed-integer- programming
    • DOI 10.1016/S1571-0661(04)00160-4, PII S1571066104001604, ATMOS 2001, Algorithmic Methods and Models for Optimization of Railways (Satellite Workshop of ICALP 2001)
    • Schöbel A (2001) A model for the delay management problem based on mixed-integer-programming. Electron Notes Theor Comput Sci 50(1):1-10 (Pubitemid 40715830)
    • (2001) Electronic Notes in Theoretical Computer Science , vol.50 , Issue.1 , pp. 1-10
    • Schobel, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.