메뉴 건너뛰기




Volumn E82-A, Issue 9, 1999, Pages 1860-1864

Modular approach for solving nonlinear knapsack problems

Author keywords

Fathoming and integration techniques; Modular approach; Nonlinear knapsack problems; Separable discrete optimization problems

Indexed keywords

NONLINEAR KNAPSACK PROBLEMS; SEPARABLE DISCRETE OPTIMIZATION PROBLEMS;

EID: 0033184713     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (9)

References (14)
  • 1
    • 0018997732 scopus 로고
    • The use of dynamic programming for the solution of a class of nonlinear programming problems
    • M.W. Cooper, "The use of dynamic programming for the solution of a class of nonlinear programming problems," Naval Res. Logist. Quart., vol.27, pp.89-95, 1981.
    • (1981) Naval Res. Logist. Quart. , vol.27 , pp. 89-95
    • Cooper, M.W.1
  • 2
    • 0017919272 scopus 로고
    • A hybrid approach to discrete mathematical programming
    • R.E. Marsten and T.L. Morin, "A hybrid approach to discrete mathematical programming," Math. Programming, vol.14, pp.21-40, 1978.
    • (1978) Math. Programming , vol.14 , pp. 21-40
    • Marsten, R.E.1    Morin, T.L.2
  • 3
    • 0037986990 scopus 로고
    • The 0-1 knapsack problem with multiple choice constraints
    • R.M. Nauss, "The 0-1 knapsack problem with multiple choice constraints," European J. Oper. Res., vol.2, pp.125-131, 1978.
    • (1978) European J. Oper. Res. , vol.2 , pp. 125-131
    • Nauss, R.M.1
  • 4
    • 0001088168 scopus 로고
    • The multiple-choice knapsack problem
    • P. Sinha and A. Zoltners, "The multiple-choice knapsack problem," Oper. Res., vol.27, pp.125-131, 1979.
    • (1979) Oper. Res. , vol.27 , pp. 125-131
    • Sinha, P.1    Zoltners, A.2
  • 6
    • 0021504980 scopus 로고
    • A branch and bound algorithm for solving the multiple-choice knapsack problem
    • M.E. Dyer, N. Kayal, and J. Walker, "A branch and bound algorithm for solving the multiple-choice knapsack problem," J. Computational Applied Math., vol.11, pp.231-249, 1984.
    • (1984) J. Computational Applied Math. , vol.11 , pp. 231-249
    • Dyer, M.E.1    Kayal, N.2    Walker, J.3
  • 8
    • 0000650174 scopus 로고
    • The nonlinear resource allocation problem
    • K.M. Bretthauer and B. Shetty, "The nonlinear resource allocation problem," Oper. Res. Comput., vol.43, pp.670-683, 1995.
    • (1995) Oper. Res. Comput. , vol.43 , pp. 670-683
    • Bretthauer, K.M.1    Shetty, B.2
  • 10
    • 33746614780 scopus 로고
    • Translated from IEICE Trans., vol.73-A, pp.550-556, 1990.
    • (1990) IEICE Trans. , vol.73 A , pp. 550-556
  • 11
    • 0000588430 scopus 로고
    • Discrete optimization via marginal analysis
    • B. Fox, "Discrete optimization via marginal analysis," Manag. Sci., vol.13, 1966.
    • (1966) Manag. Sci. , vol.13
    • Fox, B.1
  • 12
    • 85027169166 scopus 로고    scopus 로고
    • Y. Nakagawa, Easy C Programming, Asakura Shoten, 1996
    • Y. Nakagawa, Easy C Programming, Asakura Shoten, 1996.
    • Nakagawa, Y.1    Easy, C.2
  • 13
    • 0346101919 scopus 로고
    • Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
    • H. Ohtagaki, Y. Nakagawa, A. Iwasaki, and H. Narihisa, "Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems," Math. Comput. Modeling, vol.22, pp.261-272, 1995.
    • (1995) Math. Comput. Modeling , vol.22 , pp. 261-272
    • Ohtagaki, H.1    Nakagawa, Y.2    Iwasaki, A.3    Narihisa, H.4
  • 14
    • 0017524176 scopus 로고
    • A heuristic method for determining optimal reliability allocation
    • Y. Nakagawa and K. Nakashima, "A heuristic method for determining optimal reliability allocation," IEEE Trans. Reliab., vol.R-26, pp.156-161, 1977.
    • (1977) IEEE Trans. Reliab. , vol.R-26 , pp. 156-161
    • Nakagawa, Y.1    Nakashima, K.2


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