EconPapers    
Economics at your fingertips  
 

An iterative pseudo-gap enumeration approach for the Multidimensional Multiple-choice Knapsack Problem

Chao Gao, Guanzhou Lu, Xin Yao and Jinlong Li

European Journal of Operational Research, 2017, vol. 260, issue 1, 1-11

Abstract: The Multidimensional Multiple-choice Knapsack Problem (MMKP) is an important NP-hard combinatorial optimization problem with many applications. We propose a new iterative pseudo-gap enumeration approach to solving MMKPs. The core of our algorithm is a family of additional cuts derived from the reduced costs constraint of the nonbasic variables by reference to a pseudo-gap. We then introduce a strategy to enumerate the pseudo-gap values. Joint with CPLEX, we evaluate our approach on two sets of benchmark instances and compare our results with the best solutions reported by other heuristics in the literature. It discovers 10 new better lower bounds on 37 well-known benchmark instances with a time limit of 1 hour for each instance. We further give direct comparison between our algorithm and one state-of-the-art “reduce and solve” approach on the same machine with the same CPLEX, experimental results show that our algorithm is very competitive, outperforming “reduce and solve” on 18 cases out of 37.

Keywords: Integer programming; Heuristics; Multidimensional Multiple-choice Knapsack; Reduced cost constraint (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221716309675
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:260:y:2017:i:1:p:1-11

DOI: 10.1016/j.ejor.2016.11.042

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().

 
Page updated 2025-03-19
Handle: RePEc:eee:ejores:v:260:y:2017:i:1:p:1-11