Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core

DOI10.1016/j.amc.2009.08.045zbMath1179.65072MaRDI QIDQ1044419

Kostas Florios, George Mavrotas, José Rui Figueira

Publication date: 18 December 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://mpra.ub.uni-muenchen.de/105087/1/MPRA_paper_105087.pdf

zbMATH Keywords

integer programming; numerical examples; core; multi-objective programming; knapsack; Pareto set; divide and conquer; multi-dimensional; multi-objective multi-dimensional knapsack problem; multicriteria branch and bound algorithm

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C29: Multi-objective and goal programming

Related Items

Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem, The three-dimensional knapsack problem with balancing constraints, Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems, Solving 0-1 knapsack problems based on amoeboid organism algorithm, The multiobjective multidimensional knapsack problem: a survey and a new approach

Uses Software

• Knapsack
• ADBASE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
• Exact algorithm for bi-objective 0-1 knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• A minimal algorithm for the multiple-choice knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• The core concept for the Multidimensional Knapsack problem
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
• A method for generating all efficient solutions of 0-1 multi-objective linear programming problem
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• A New Algorithm for the 0-1 Knapsack Problem
• An Algorithm for Large Zero-One Knapsack Problems