메뉴 건너뛰기




Volumn 149, Issue 1, 2007, Pages 49-56

Algebraic modeling for IP and MIP (GAMS)

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33846857338     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-006-0104-x     Document Type: Review
Times cited : (8)

References (12)
  • 2
    • 33846891930 scopus 로고    scopus 로고
    • General Algebraic Modeling System (GAMS)
    • J. Kallrath Ed, Kluwer Academic Publishers, pp
    • Bussieck, M.R. and A. Meeraus. (2003). "General Algebraic Modeling System (GAMS)." In J. Kallrath (Ed.), Modeling Languages in Mathematical Optimization. Kluwer Academic Publishers, pp. 137-157.
    • (2003) Modeling Languages in Mathematical Optimization , pp. 137-157
    • Bussieck, M.R.1    Meeraus, A.2
  • 5
    • 84872988168 scopus 로고    scopus 로고
    • GAMS Development. bchoil.gms. (2003). Oil Pipeline Design Problem using BCH Facility. The GAMS Model Library. http://www.gams.com/modlib/ modlib.htm
    • GAMS Development. bchoil.gms. (2003). "Oil Pipeline Design Problem using BCH Facility." The GAMS Model Library. http://www.gams.com/modlib/ modlib.htm
  • 7
    • 4344621144 scopus 로고    scopus 로고
    • Hoffmann, K.-H.,W. Jäger, T. Lohmann, and H. Schunck Eds, Springer
    • Hoffmann, K.-H.,W. Jäger, T. Lohmann, and H. Schunck (Eds). (1997). "Mathematik-Schlüsseltechnologie für die Zukunft." Springer.
    • (1997) Mathematik-Schlüsseltechnologie für die Zukunft
  • 8
    • 0342571667 scopus 로고    scopus 로고
    • The ABACUS System for Branch-and-Cut-and-Price Algorithms in Integer Programming and Combinatorial Optimization
    • Jünger,M. and S. Thienel. (2000). "The ABACUS System for Branch-and-Cut-and-Price Algorithms in Integer Programming and Combinatorial Optimization." Software: Practice and Experience, 30, 1325-1352.
    • (2000) Software: Practice and Experience , vol.30 , pp. 1325-1352
    • Jünger, M.1    Thienel, S.2
  • 10
    • 2142793094 scopus 로고
    • A Branch-and-Cut Algorithm for the Single-Commodity, Uncapacitated, Fixed-Charge Network Flow Problem
    • Ortega, F. and L. Wolsey. (1993). "A Branch-and-Cut Algorithm for the Single-Commodity, Uncapacitated, Fixed-Charge Network Flow Problem." Networks, 41(3), 143-158.
    • (1993) Networks , vol.41 , Issue.3 , pp. 143-158
    • Ortega, F.1    Wolsey, L.2
  • 11
    • 33846864097 scopus 로고
    • Mathematiker Sind Oft Die Besseren Ingenieure
    • Preuss, A. (1993). "Mathematiker Sind Oft Die Besseren Ingenieure." Impulse 5.
    • (1993) Impulse , vol.5
    • Preuss, A.1


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