HARD PROBLEM GENERATION FOR MKP

Authors

  • María A. Osorio School of Computer Sciences, Universidad Autónoma de Puebla
  • Germán Cuaya School of Computer Sciences, Universidad Autónoma de Puebla

Keywords:

Multidimensional Knapsack Problem, Hard Problems Generation, Integer Programming

Abstract

We developed generators that produce challenging MKP instances. Our approaches uses independently exponential distributions over a wide range to generate the constraint coefficients, and the corresponding average for each variable is used to calculate directly correlated coefficients in the objective function. RHS values are a percentage of the sum of constraint coefficients. We present a comparative table with the average performance of the most important generators reported in the literature and our generators over a wide range of parameters and instances in the OR Library

Downloads

Download data is not yet available.

Downloads

Published

2023-06-12

How to Cite

Osorio, M. A., & Cuaya , G. (2023). HARD PROBLEM GENERATION FOR MKP . Investigación Operacional, 26(3). Retrieved from https://revistas.uh.cu/invoperacional/article/view/6445

Similar Articles

1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.