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.018zbMATH Open1410.90273OpenAlexW2415378414MaRDI QIDQ670759FDOQ670759
Authors: George Mavrotas, Kostas Florios, 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
Recommendations
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- The core concept for the Multidimensional Knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
combinatorial optimizationmetaheuristicsmulti-objective programmingbranch-and-boundevolutionary computationsmulti-dimensional knapsack problems
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria Optimization
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Title not available (Why is that?)
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- An Algorithm for Large Zero-One Knapsack Problems
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- New trends in exact algorithms for the \(0-1\) knapsack problem
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- The multidimensional knapsack problem: structure and algorithms
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Multi-directional local search
- Discrete-variable extremum problems
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Core problems in knapsack algorithms
- The core concept for the Multidimensional Knapsack problem
- The three-dimensional knapsack problem with balancing constraints
- Multicriteria 0-1 knapsack problems with \(k\)-min objectives
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Cited In (6)
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- Cooperative multiobjective optimization with bounds on objective functions
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Approximate and exact merging of knapsack constraints with cover inequalities
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
Uses Software
This page was built for publication: An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670759)
