메뉴 건너뛰기




Volumn 1, Issue , 1999, Pages 1-10

Experiments with the "Oregon Trail Knapsack Problem"

Author keywords

[No Author keywords available]

Indexed keywords


EID: 53149104363     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (7)

References (13)
  • 1
    • 0000843040 scopus 로고
    • An algorithm for large zero-one knapsack problems
    • E. Balas and E. Zemel. An algorithm for large zero-one knapsack problems. Operations Research 28, 1130-1154, 1980.
    • (1980) Operations Research , vol.28 , pp. 1130-1154
    • Balas, E.1    Zemel, E.2
  • 3
    • 0001366593 scopus 로고
    • Discrete variable extremum problems
    • G.B. Dantzig. Discrete variable extremum problems. Operations Research 5, 266-277, 1957.
    • (1957) Operations Research , vol.5 , pp. 266-277
    • Dantzig, G.B.1
  • 4
    • 0019477279 scopus 로고
    • The Lagrangian relaxation method for solving integer programming problems
    • M.L. Fisher. The Lagrangian relaxation method for solving integer programming problems. Management Science 27, 1-18, 1981.
    • (1981) Management Science , vol.27 , pp. 1-18
    • Fisher, M.L.1


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