지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
초록· 키워드
오류제보하기
We perform a computational study on 0-1 knapsack problems generated under explicit correlation induction. A total of 2000 100-variable test problems are solved. We use two solution methods : (1) a well known heuristic and (2) a representative branch and bound type algorithm. Two different performance measures are considered : (1) the number of nodes needed to find an optimal solution and (2) the relative error of the heuristic solution. We also examine the effect of different joint probability mass functions (pmfs) for the coefficient values on the performance of the solution procedure.
목차
Abstract
1. Introduction
2. Background
3. Assumptions
4. Test Problem Description
5. Generating and Solving Test Problems
6. Computational Results and Analysis
7. Discussions
References
Appendix A.
참고문헌 (28)
참고문헌 신청
[학술지(정기간행물)] - / 1980 / An Algorithm for Large Zero-One Knapsack Problems 28 (4) : 1130 ~ 1154
[학술지(정기간행물)] - / 1995 / Designing and Reporting on Computational Experiments with Heuristic Methods 1 (1) : 9 ~ 32
[학술지(정기간행물)] - / 2002 / An Investigation of the Relationship between Problem Characteristics and Algorithm Performance：a Case Study of the GAP 34 (3) : 297 ~ 312
[학술지(정기간행물)] - / 1982 / An Algorithm for the Solution of the 0-1 Knapsack Problem 28 : 269 ~ 287
[학술지(정기간행물)] - / 1994 / Needed：an Empirical Science of Algorithms 42 (2) : 201 ~ 212
[학술지(정기간행물)] - / 1995 / Designing and Reporting on Computational Experiments with Heuristic Methods 1 (1) : 9 ~ 32
[학술지(정기간행물)] - / 2002 / An Investigation of the Relationship between Problem Characteristics and Algorithm Performance：a Case Study of the GAP 34 (3) : 297 ~ 312
[학술지(정기간행물)] - / 1982 / An Algorithm for the Solution of the 0-1 Knapsack Problem 28 : 269 ~ 287
[학술지(정기간행물)] - / 1994 / Needed：an Empirical Science of Algorithms 42 (2) : 201 ~ 212
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Multiple Choice Knapsack-based Heuristic Algorithm for Paper Cutting Optimization
한국경영과학회 학술대회논문집
2013 .05
-
Cover Inequalities for the Robust Knapsack Problem
Management Science and Financial Engineering
2008 .05
-
A Solution Approach for Cardinality Constrained Knapsack Problem
한국경영과학회 학술대회논문집
2012 .05
-
Notes on Reducing Mixed Integer Knapsack Problems
한국경영과학회지
1992 .06
-
On the Stochastic Knapsack Value Function for Random Items of Multiple Classes
한국경영과학회 학술대회논문집
1993 .01
-
On the Separation of the Rank-1 Chvatal-Gomory Inequalities for the Fixed-Charge 0-1 Knapsack Problem
한국경영과학회지
2011 .06
-
Lifting Cover Inequalities for the Precedence - Constrained Knapsack Problem
한국경영과학회 학술대회논문집
1994 .01
-
Optimization Algorithms for Knapsack Problem with Queuing Delays under Uncertainty
한국경영과학회 학술대회논문집
2017 .04
-
용량이 변화하는 ( 0 , 1 ) - 배낭문제에 대한 절단평면 생성방안 ( A Cut Generation Method for the ( 0 , 1 ) - Knapsack problem with a Variable Capacity )
한국경영과학회지
2000 .09
-
Risk-Averse Knapsack Problem with Profit Interdiction
한국경영과학회 학술대회논문집
2017 .04
-
FPTAS and pseudo-polynomial separability of integral hull of generalized knapsack problem
한국경영과학회 학술대회논문집
2004 .11
-
일반 다중선택 선형배낭문제에 대한 효율적인 해법 ( An Efficient Algorithm for the Generalized Multiple Choice Linear Knapsack Problem )
한국경영과학회지
1990 .12
-
일반 다중선택 선형배낭문제의 확장문제에 대한 효율적인 해법 ( An Efficient Algorithm for an Extension of the Generalized Linear Multiple Choice Knapsack Problem )
한국경영과학회지
1992 .03
-
[Session B1 생산일정/수리계획]About fully polynomial approximability of the generalized knapsack problem
한국경영과학회 학술대회논문집
2003 .11
-
A Cutting-plane Generation Method for a Variable-capacity (0,1)-Knapsack Problem with General Integer Variables
Management Science and Financial Engineering
2004 .05
-
An AI Approach with Tabu Search to Solve Multi-level Knapsack Problems : Using Cycle Detection , Short-term and Long-term Memory
한국경영과학회지
1997 .09
-
Robust Version of the Bilevel Knapsack with Interdiction Constraints
한국경영과학회 학술대회논문집
2019 .04
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2009-325-015540159