One approach to solving a discrete production planning problem with interval data

DOI10.1134/S0081543808060059MaRDI QIDQ735645zbMATH OpenFDO

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

Publication date 23 October 2009

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• L-class enumeration algorithms for a discrete production planning problem with interval resource quantities
• Interval discrete programming
• Integer programming problems with inexact data: Exact and approximate solutions
• scientific article; zbMATH DE number 4043607
• A COMPUTATIONAL METHOD FOR ALL-INTEGER INTERVAL LINEAR PROGRAMMING

Cites work

• 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 892018 (Why is no real title available?)
• Optimal project selection: Stochastic knapsack with finite time horizon
• Robust discrete optimization and its applications

Cited in

(4)

• Multiindex optimal production planning problems
• L-class enumeration algorithms for a discrete production planning problem with interval resource quantities
• Interval discrete programming
• Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: One approach to solving a discrete production planning problem with interval data

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