L-class enumeration algorithms for a discrete production planning problem with interval resource quantities

Authors:
M. V. Devyaterikova;A. A. Kolokolov;A. P. Kolosov
Affiliations:
Omsk State Technical University, 11, Mir av., Omsk 644050, Russian Federation;Omsk Branch of Sobolev Institute of Mathematics of Russian Academy of Sciences, 13, Pevtsov St., Omsk 644099, Russian Federation;Omsk Branch of Sobolev Institute of Mathematics of Russian Academy of Sciences, 13, Pevtsov St., Omsk 644099, Russian Federation
Venue:
Computers and Operations Research
Year:
2009

Citing 4
Cited 0

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
Joint Inventory Replenishment and Component Allocation Optimization in an Assemble-to-Order System

Management Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

A discrete production planning problem which may be formulated as the multidimensional knapsack problem is considered, while resource quantities of the problem are supposed to be given as intervals. An approach for solving this problem based on using its relaxation set is suggested. Some L-class enumeration algorithms for the problem are described. Results of computational experiments are presented.