메뉴 건너뛰기




Volumn 29, Issue 11, 2002, Pages 1559-1581

A passenger demand model for airline flight scheduling and fleet routing

Author keywords

Integer multiple commodity network flow problem; Lagrangian relaxation; Least cost flow augmenting algorithm; Time space network

Indexed keywords

ALGORITHMS; DECISION MAKING; INTEGER PROGRAMMING; MATHEMATICAL MODELS;

EID: 0036722286     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00046-6     Document Type: Article
Times cited : (74)

References (22)
  • 3
    • 0002110806 scopus 로고
    • Applying integer linear programming to the fleet assignment problem
    • (1989) Interfaces , vol.19 , pp. 20-28
    • Abara, J.1
  • 21
    • 0024769872 scopus 로고
    • A review of sensitivity results for linear networks and a new approximation to reduce the effects of degeneracy
    • (1989) Transportation Science , vol.23 , pp. 231-243
    • Powell, W.B.1
  • 22
    • 0039472002 scopus 로고    scopus 로고
    • Approximating reduced costs under degeneracy in a network flow problem with side constraints
    • (1996) Networks , vol.27 , pp. 267-278
    • Yan, S.1


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