Interval algorithms and their application to discrete optimization of multistep processes

DOI10.1007/BF01074834MaRDI QIDQ3793951zbMATH OpenFDO

Authors A. G. Kovalenko

Publication date 1987

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01074834

zbMATH Keywords

discrete optimizationmultistep processespiecewise-constant Bellman functions

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 1292983
• Discrete optimization problems with interval parameters
• scientific article; zbMATH DE number 1159798
• Iterative optimization algorithms for discrete-continuous processes
• An interval algorithm for multi-objective optimization
• Interval discrete programming
• scientific article; zbMATH DE number 4066243
• scientific article; zbMATH DE number 1861585
• Interval algorithm for mixed integer nonlinear two-level programming problems
• Interval systems and interval optimization: theory and applications

Cited in

(1)

• The Discrete Heal Algorithm With Intermediate Goods

This page was built for publication: Interval algorithms and their application to discrete optimization of multistep processes

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