DocumentCode :
3228355
Title :
Hard problem generation for MKP
Author :
Osorio, María A. ; Cuaya, Germán
Author_Institution :
Sch. of Comput. Sci., Univ. Autonoma de Puebla, Mexico
fYear :
2005
fDate :
26-30 Sept. 2005
Firstpage :
290
Lastpage :
295
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 for the most important generators reported in the literature and our generators, over a wide range of parameters and instances in the OR library.
Keywords :
computational complexity; exponential distribution; integer programming; knapsack problems; OR library; constraint coefficient; exponential distribution; hard problem generation; integer programming; multidimensional knapsack problem; Approximation algorithms; Benchmark testing; Exponential distribution; Heuristic algorithms; Libraries; Linear programming; Multidimensional systems; Operations research; Resource management; Solids; Hard Problems Generation; Integer Programming.; Multdimensional Knapsack Problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science, 2005. ENC 2005. Sixth Mexican International Conference on
ISSN :
1550-4069
Print_ISBN :
0-7695-2454-0
Type :
conf
DOI :
10.1109/ENC.2005.22
Filename :
1592231
Link To Document :
بازگشت