메뉴 건너뛰기




Volumn 127, Issue 1-4, 2004, Pages 259-281

A flexible, fast, and optimal modeling approach applied to crew rostering at London Underground

Author keywords

Aggregation; Crew rostering; Cyclic graph; Decomposition; Mixed integer linear programming; Rota

Indexed keywords


EID: 4043092239     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000019092.76669.a1     Document Type: Article
Times cited : (27)

References (6)
  • 1
    • 0036239414 scopus 로고    scopus 로고
    • Solving real-world linear programs: A decade and more of progress
    • Bixby, R. (2002). "Solving Real-World Linear Programs: A Decade and More of Progress." Operations Research 50(1), 3-15.
    • (2002) Operations Research , vol.50 , Issue.1 , pp. 3-15
    • Bixby, R.1
  • 2
    • 0032202012 scopus 로고    scopus 로고
    • Modeling and solving the crew rostering problem
    • Caprara, A., M. Fischetti, P. Toth, and D. Vigo. (1998). "Modeling and Solving the Crew Rostering Problem." Operations Research 46(6), 820-830.
    • (1998) Operations Research , vol.46 , Issue.6 , pp. 820-830
    • Caprara, A.1    Fischetti, M.2    Toth, P.3    Vigo, D.4
  • 6
    • 0010986664 scopus 로고    scopus 로고
    • Algorithms for hybrid MILP/CP models for a class of optimization problems
    • Jain, V. and I.E. Grossman. (2001). "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems." INFORMS Journal on Computing 13(4), 258-276.
    • (2001) INFORMS Journal on Computing , vol.13 , Issue.4 , pp. 258-276
    • Jain, V.1    Grossman, I.E.2


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