메뉴 건너뛰기




Volumn 45, Issue 2, 2011, Pages 246-257

Solution of the train platforming problem

Author keywords

0.1 quadratic programming; Linearization; Train platforming

Indexed keywords

HEURISTIC METHODS; LINEARIZATION; OPTIMIZATION; QUADRATIC PROGRAMMING;

EID: 79957466386     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1100.0366     Document Type: Article
Times cited : (69)

References (12)
  • 1
    • 0023500313 scopus 로고
    • Scheduling jobs with fixed starting and finishing times
    • Arkin, E. M., E. L. Silverberg. 1987. Scheduling jobs with fixed starting and finishing times. Discrete Appl. Math. 18 1-8.
    • (1987) Discrete Appl. Math. , vol.18 , pp. 1-8
    • Arkin, E.M.1    Silverberg, E.L.2
  • 2
    • 0042205090 scopus 로고    scopus 로고
    • Using integer programming to solve the train platforming problem
    • Billionnet, A. 2003. Using integer programming to solve the train platforming problem. Transportation Sci. 37 213-222.
    • (2003) Transportation Sci. , vol.37 , pp. 213-222
    • Billionnet, A.1
  • 4
    • 0037355373 scopus 로고    scopus 로고
    • Scheduling and platforming trains at busy complex stations
    • DOI 10.1016/S0965-8564(02)00012-5, PII S0965856402000125
    • Carey, M., S. Carville. 2003. Scheduling and platforming trains at busy complex stations. Transportation Res. A 37 195-224. (Pubitemid 36128978)
    • (2003) Transportation Research Part A: Policy and Practice , vol.37 , Issue.3 , pp. 195-224
    • Carey, M.1    Carville, S.2
  • 6
    • 33646030581 scopus 로고    scopus 로고
    • A combinatorial algorithm for weighted stable sets in bipartite graphs
    • Faigle, U., G. Frahlin. 2006. A combinatorial algorithm for weighted stable sets in bipartite graphs. Discrete Appl. Math. 154 1380-1391.
    • (2006) Discrete Appl. Math. , vol.154 , pp. 1380-1391
    • Faigle, U.1    Frahlin, G.2
  • 11


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