Cubic Knapsack Problem Instances

Published: 12 February 2025| Version 1 | DOI: 10.17632/y28j8mgf8k.1
Contributors:
Ibrahim Dan Dije, Franklin Djeumou Fomeni, Leandro C. Coelho

Description

The data folder contains detailed description of the data set presented here. The data set is the data set used in our paper: "A 3-space dynamic programming heuristic for the cubic knapsack problem." The paper is under review, the full reference to the paper will be updated after being published

Files

Steps to reproduce

The step of production is described in the paper. All the code C for data reproduce can be shared by demand.

Institutions

  • Universite Laval
  • Universite du Quebec a Montreal

Categories

Combinatorial Optimization, Graph Theory

Funders

Licence