Hard Problem Generation for MKP

Authors:
Maria A. Osorio;Germn Cuaya
Affiliations:
Universidad Autonoma de Puebla, Ciudad Universitaria, Puebla, Mexico;Universidad Autonoma de Puebla, Ciudad Universitaria, Puebla, Mexico
Venue:
ENC '05 Proceedings of the Sixth Mexican International Conference on Computer Science
Year:
2005

Citing 10
Cited 0

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Easy problems are sometimes hard

Artificial Intelligence
Mixed logical-linear programming

Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
Logic-Based Methods for Optimization

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
A Minimal Algorithm for the Bounded Knapsack Problem

INFORMS Journal on Computing
The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance

Management Science
Encyclopedia of Operations Research and Management Science

Encyclopedia of Operations Research and Management Science
An empirical analysis of search in GSAT

Journal of Artificial Intelligence Research
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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.