\(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities
type: Item
instance of: scholarly article
title: \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities
zbMATH Open document ID: 1163.90455
author: M. V. Devyaterikova
author: A. P. Kolosov
author: A. A. Kolokolov
published in: Computers \& Operations Research
publication date: 2008-11-07T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5363300
zbMATH Keywords: production planning
zbMATH Keywords: integer programming
zbMATH Keywords: interval data
zbMATH Keywords: regular partitions
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.cor.2007.10.005
OpenAlex ID: W2021701162
cites work: Q3905076
cites work: Robust discrete optimization and its applications
cites work: Q4880741
cites work: Q4789853
cites work: Derived eigenvalues of symmetric matrices, with applications to distance geometry
cites work: Q3993418
cites work: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
cites work: Optimal project selection: Stochastic knapsack with finite time horizon
cites work: Q4198056
cites work: Approximation algorithms for knapsack problems with cardinality constraints
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Q4852854
cites work: Stability analysis for \(L\)-partitions in a finite-dimensional space
cites work: Stability analysis of some discrete optimization algorithms
DOI: 10.1016/J.COR.2007.10.005
description: scientific article; zbMATH DE number 5363300