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

DOI10.1016/J.COR.2007.10.005MaRDI QIDQ954026zbMATH OpenOpenAlexFDO

Authors M. V. Devyaterikova, A. P. Kolosov, A. A. Kolokolov

Publication date 7 November 2008

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2007.10.005

zbMATH Keywords

integer programminginterval dataproduction planningregular partitions

Mathematics Subject Classification ID

Integer programming (90C10) Production models (90B30)

Recommendations

• One approach to solving a discrete production planning problem with interval data
• The knapsack problem with generalized upper bounds
• A polynomial algorithm for a multi-item capacitated production planning problem
• scientific article; zbMATH DE number 3984973
• An optimal algorithm for the multi-item capacitated production planning problem

Cites work

• scientific article; zbMATH DE number 3715310 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1859294 (Why is no real title available?)
• scientific article; zbMATH DE number 808805 (Why is no real title available?)
• scientific article; zbMATH DE number 892018 (Why is no real title available?)
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
• A genetic algorithm for the multidimensional knapsack problem
• Approximation algorithms for knapsack problems with cardinality constraints
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• Optimal project selection: Stochastic knapsack with finite time horizon
• Robust discrete optimization and its applications
• Stability analysis for \(L\)-partitions in a finite-dimensional space
• Stability analysis of some discrete optimization algorithms
• L-class enumeration algorithms for a discrete production planning problem with interval resource quantities

Cited in

(4)

• Estimation of the number of iterations in integer programming algorithms using the regular partitions method
• One approach to solving a discrete production planning problem with interval data
• A multi-objective optimization approach for integrated production planning under interval uncertainties in the steel industry
• L-class enumeration algorithms for a discrete production planning problem with interval resource quantities

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954026)