메뉴 건너뛰기




Volumn 9, Issue 1, 1997, Pages 43-50

A new knapsack solution approach by integer equivalent aggregation and consistency determination

Author keywords

Equivalent aggregation of integer valued equations; Testing the consistency of a linear equation in integer variables

Indexed keywords


EID: 0011043496     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.9.1.43     Document Type: Article
Times cited : (10)

References (4)
  • 1
    • 85012688561 scopus 로고
    • Princeton University Press, Princeton, NJ
    • R. BELLMAN, 1957. Dynamic Programming, Princeton University Press, Princeton, NJ.
    • (1957) Dynamic Programming
    • Bellman, R.1
  • 4
    • 18844407816 scopus 로고
    • Shortest-route methods: 2. Group knapsacks, expanded networks, and branch-and-bound
    • E.V. DENARDO, B.L. FOX, 1979. Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound, Operations Research, 27, 548-566.
    • (1979) Operations Research , vol.27 , pp. 548-566
    • Denardo, E.V.1    Fox, B.L.2


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