An iterative pseudo-gap enumeration approach for the Multidimensional Multiple-choice Knapsack Problem-Reference-Cited by-同舟云学术

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

Published:2017-07 Issue:1 Volume:260 Page:1-11
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Gao Chao,Lu Guanzhou,Yao Xin,Li Jinlong

Funder

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference28 articles.

1. Heuristic solutions for the multiple-choice multi-dimension Knapsack problem;Akbar,2001

2. Heuristics for determining the number of warehouses for storing noncompatible products;Basnet;International Transactions in Operational Research,2005

3. A multi-level search strategy for the 0–1 multidimensional Knapsack problem;Boussier;Discrete Applied Mathematics,2010

4. A reduce and solve approach for the multiple-choice multidimensional Knapsack problem;Chen;European Journal of Operational Research,2014

5. Hybrid algorithms for the multiple-choice multi-dimensional Knapsack problem;Cherfi;International Journal of Operational Research,2009

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Binary metaheuristic algorithms for 0–1 knapsack problems: Performance analysis, hybrid variants, and real-world application;Journal of King Saud University - Computer and Information Sciences;2024-07

2. Bicriteria food packaging process optimization in double-layered upright and diagonal multihead weighers;Journal of Computational and Applied Mathematics;2023-08

3. Modified Artificial Bee Colony Algorithm for Multiple-Choice Multidimensional Knapsack Problem;IEEE Access;2023

4. Efficient 0/1-Multiple-Knapsack Problem Solving by Hybrid DP Transformation and Robust Unbiased Filtering;Algorithms;2022-09-30

5. Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems;Computers & Operations Research;2022-07