Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
From MaRDI portal
Publication:537958
DOI10.1007/s10898-010-9552-6zbMath1225.90112OpenAlexW2067579531MaRDI QIDQ537958
Alexandros Antoniadis, George Mavrotas, José Rui Figueira
Publication date: 23 May 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9552-6
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (7)
Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ Finding all nondominated points of multi-objective integer programs ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics ⋮ A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Uses Software
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
- Pareto optimality, game theory and equilibria
- Exact algorithm for bi-objective 0-1 knapsack problem
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- 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
- A survey of recent developments in multiobjective optimization
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- 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
- The identification of nondominated and efficient paths on a network
This page was built for publication: Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
