An efficient algorithm for the collapsing knapsack problem

Authors:
Jigang Wu;Thambipillai Srikanthan
Affiliations:
Centre for High Performance Embedded Systems, School of Computer Engineering, Nanyang Technological University, Singapore 639798, Republic of Singapore;Centre for High Performance Embedded Systems, School of Computer Engineering, Nanyang Technological University, Singapore 639798, Republic of Singapore
Venue:
Information Sciences: an International Journal
Year:
2006

Citing 5
Cited 1

A new algorithm for the 0-1 knapsack problem

Management Science
An exact algorithm for the 0–1 collapsing knapsack problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
Simple but efficient approaches for the collapsing knapsack problem

Discrete Applied Mathematics
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Management Science
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems

Operations Research Letters

An index selection method without repeated optimizer estimations

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

The collapsing knapsack problem (CKP) is a type of nonlinear knapsack problem in which the knapsack size is a non-increasing function of the number of items included. This paper proposes an exact algorithm for CKP by partitioning CKP to some subproblems, then solving them with the improved expanding-core technique. The proposed algorithm solves the subproblems in the special processing order resulting in the reduction of computing time. Experimental results show that the proposed algorithm is an efficient approach for various random instances of size up to 1000.