An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
DOI10.1016/j.amc.2015.08.018zbMath1410.90273MaRDI QIDQ670759
Kostas Florios, George Mavrotas, José Rui Figueira
Publication date: 20 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.08.018
combinatorial optimization; metaheuristics; branch-and-bound; multi-objective programming; evolutionary computations; multi-dimensional knapsack problems
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C29: Multi-objective and goal programming
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Uses Software
