Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
Abstract
Abstract is not available.- Core
- Knapsack
- Multi-dimensional
- Multi-objective programming
- Mathematics, Applied
- Branch-and-bound algorithms
- Computational experiment
- Core problems
- Divide and conquer
- Exact solution
- Integer programming problems
- Medium size
- Multi objective
- Multi-criteria
- Multidimensional knapsack problems
- Pareto set
- Quality of solution
- Solution time
- Sub-problems
- Trade off
- Algorithms
- Benchmarking
- Computer software selection and evaluation
- Dynamic programming
- Integer programming
- Linear programming
- Multiobjective optimization
- Problem solving
- Core
- Knapsack
- Multi-dimensional
- Multi-objective programming
- Mathematics, Applied
- Branch-and-bound algorithms
- Computational experiment
- Core
- Core problems
- Divide and conquer
- Exact solution
- Integer programming problems
- Knapsack
- Medium size
- Multi objective
- Multi-criteria
- Multi-dimensional
- Multi-objective programming
- Multidimensional knapsack problems
- Pareto set
- Quality of solution
- Solution time
- Sub-problems
- Trade off
- Algorithms
- Benchmarking
- Computer software selection and evaluation
- Dynamic programming
- Integer programming
- Linear programming
- Multiobjective optimization
- Problem solving
Similar works
Full text
Last time updated on 03/06/2016
This paper was published in DSpace@NTUA (National Technical Univ. of Athens).
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.