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

DOI10.1016/J.COR.2007.10.005zbMath1163.90455OpenAlexW2021701162MaRDI QIDQ954026

M. V. Devyaterikova, A. P. Kolosov, Alexander 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 programmingproduction planninginterval dataregular partitions

Mathematics Subject Classification ID

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

Related Items (3)

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

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities
• A genetic algorithm for the multidimensional knapsack problem
• Robust discrete optimization and its applications
• Approximation algorithms for knapsack problems with cardinality constraints
• Stability analysis of some discrete optimization algorithms
• Optimal project selection: Stochastic knapsack with finite time horizon
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems

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