Home > Research > Datasets > Multidimensional Knapsack Problem

Research

Electronic data

  • README.txt

    2.82 KB, text/plain

    Dataset

    Available under license: CC BY

    Date added: 6/07/22

  • MKP_upper_bounds.xlsx

    81.5 KB, application/vnd.openxmlformats-officedocument.spreadsheetml.sheet

    Dataset

    Available under license: CC BY

    Date added: 6/07/22

  • MKP_upper_bounds.ods

    63.8 KB, application/vnd.oasis.opendocument.spreadsheet

    Dataset

    Available under license: CC BY

    Date added: 6/07/22

DOI

View graph of relations

Multidimensional Knapsack Problem

Dataset

Description

The Multidimensional Knapsack Problem is a classic problem in combinatorial optimization, and several sets of benchmark instances exist. We give results for five of those sets. For each instance, we give the following: the optimal solution value (or best known lower bound), the upper bound from the linear programming relaxation, and the upper bound from the surrogate dual. More details can be found in the file "README.txt".
Date made available6/07/2022
PublisherLancaster University
Date of data production6/07/2022

Contact person

Relations

Projects

Research outputs