메뉴 건너뛰기




Volumn 5, Issue 2, 2011, Pages 307-317

The fractional minimal cost flow problem on network

Author keywords

Check number; Dual problem; Fractional minimum cost flow problem

Indexed keywords

CHECK NUMBER; DUAL PROBLEM; MINIMAL COST; MINIMUM COST FLOW PROBLEM; NUMERICAL EXAMPLE; OPTIMAL SOLUTIONS; OPTIMALITY CONDITIONS; SIMPLEX ALGORITHM;

EID: 79952902095     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-010-0210-1     Document Type: Article
Times cited : (11)

References (8)
  • 2
    • 34250367551 scopus 로고    scopus 로고
    • Linear fractional programming and duality
    • Chadha S. S., Chadha V.: Linear fractional programming and duality. CEJOR 15, 119-125 (2007).
    • (2007) Cejor , vol.15 , pp. 119-125
    • Chadha, S.S.1    Chadha, V.2
  • 6
    • 0022101198 scopus 로고
    • A parametric method for solving the linear fractional programming problem
    • Wolf H.: A parametric method for solving the linear fractional programming problem. Oper. Res. 33, 835-841 (1985).
    • (1985) Oper. Res. , vol.33 , pp. 835-841
    • Wolf, H.1
  • 8
    • 79952901157 scopus 로고    scopus 로고
    • A linear fractional programming problem on N-complex
    • Zheng H. D.: A linear fractional programming problem on N-complex. J. Appl. Math. 1(19), 158-161 (1996).
    • (1996) J. Appl. Math. , vol.1 , Issue.19 , pp. 158-161
    • Zheng, H.D.1


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