Classes of discrete optimization problems and their decision problems
From MaRDI portal
Publication:2265336
Cites work
- Classes of discrete optimization problems and their decision problems
- Composition Principles for Synthesis of Optimal Multistage Processes
- Contraction Mappings in the Theory Underlying Dynamic Programming
- Finite-State Processes and Dynamic Programming
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 3174053 (Why is no real title available?)
- scientific article; zbMATH DE number 7354705 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3313249 (Why is no real title available?)
- Minimal representations of some classes of dynamic programming
- Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type
- Representation theorems for equivalent optimization problems
- Solvable classes of discrete dynamic programming
- The concept of state in discrete dynamic programming
Cited in
(5)
This page was built for publication: Classes of discrete optimization problems and their decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2265336)