ms·1976년 9월 1일
An Efficient Algorithm for the 0-1 Knapsack Problem
Management Science
124
피인용
28.0
FWCI
10
IS/마케팅/OM 탑저널 피인용
8
IS/마케팅/OM 탑저널 참고문헌
- 주제다목적 최적화 · 생산·최적화
01Abstract
In this note we present an efficient algorithm for the 0-1 knapsack problem and announce the availability of a callable FORTRAN subroutine which solves this problem. Computational results show that 50 variable problems can be solved in an average of 4 milliseconds and 200 variable problems in an average of 7 milliseconds on an IBM 360/91.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 23(1) · 27–31
- 토픽Optimization and Packing Problems · Industrial and Manufacturing Engineering
- DOI10.1287/mnsc.23.1.27
- 저자Robert M. Nauss