An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics-Reference-Cited by-同舟云学术

An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics

Published:2015-11 Issue: Volume:270 Page:25-43
ISSN:0096-3003
Container-title:Applied Mathematics and Computation
language:en
Short-container-title:Applied Mathematics and Computation

Author:

Mavrotas George,Florios Kostas,Figueira José Rui

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Mathematics

Reference42 articles.

1. Knapsack Problems;Kellerer,2004

2. Knapsack Problems: Algorithms and Computer Implementations;Martello,1990

3. The three-dimensional knapsack problem with balancing constraints;Baldi;Appl. Math. Comput.,2012

4. Packing problems in transportation and supply chain: new problems and trends;Perboli;Procedia - Social Behav. Sci.,2014

5. Recent advances in multi-dimensional packing problems;Crainic,2012

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

1. Vehicle Routing Problem Considering Electric Vehicle Battery Consumption;2023 3rd International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME);2023-07-19

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

3. Probing the Pareto front of a large-scale multiobjective problem with a MIP solver;Operational Research;2022-06-06

4. Utilizing dependence among variables in evolutionary algorithms for mixed-integer programming: A case study on multi-objective constrained portfolio optimization;Swarm and Evolutionary Computation;2021-10

5. Solving 0-1 Bi-Objective Multi-dimensional Knapsack Problems Using Binary Genetic Algorithm;Heuristics for Optimization and Learning;2020-12-16