메뉴 건너뛰기




Volumn 49, Issue 5, 2001, Pages 771-783

Inverse optimization

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COST BENEFIT ANALYSIS; INVERSE PROBLEMS; MATRIX ALGEBRA; POLYNOMIALS; VECTORS;

EID: 0035465539     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.49.5.771.10607     Document Type: Article
Times cited : (422)

References (35)
  • 2
    • 0003833348 scopus 로고    scopus 로고
    • Combinatorial algorithms for inverse network flow problems
    • Working Paper, Sloan School of Management, MIT, Cambridge, MA
    • (1998)
    • Ahuja, R.K.1    Orlin, J.B.2
  • 4
    • 0035463786 scopus 로고    scopus 로고
    • A fast scaling algorithm for minimizing separable convex functions subject to chain constraints
    • (2001) Oper. Res. , vol.49 , pp. 784-789
    • Ahuja, R.K.1    Orlin, J.B.2
  • 7
    • 0007423767 scopus 로고    scopus 로고
    • The inverse newsvendor problem: Choosing an optimal demand portfolio for capacitated resources
    • Technical Report, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI
    • (1997)
    • Carr, S.C.1    Lovejoy, W.S.2
  • 10
    • 0007430588 scopus 로고    scopus 로고
    • Minimum-revenue congestion pricing, Part 1: A fast algorithm for the single-origin case
    • Technical Report, The Volpe National Transportation Systems Center, Kendall Square, Cambridge, MA
    • (1997)
    • Dial, B.1
  • 20
  • 27
    • 85037309890 scopus 로고    scopus 로고
    • Personal communication. CSX Transportation, Jacksonville, FL
    • (1999)
    • Shan, Y.1


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