Classes of discrete optimization problems and their decision problems

DOI10.1016/S0022-0000(74)80024-3zbMath0274.90027MaRDI QIDQ2265336

Toshihide Ibaraki

Publication date: 1974

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (5)

The principle of optimality in the design of efficient algorithms ⋮ A general framework for enumerating equivalence classes of solutions ⋮ Classes of discrete optimization problems and their decision problems ⋮ On the optimality of algorithms for finite state sequential decision processes ⋮ Solvable classes of discrete dynamic programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classes of discrete optimization problems and their decision problems
• The concept of state in discrete dynamic programming
• Solvable classes of discrete dynamic programming
• Minimal representations of some classes of dynamic programming
• Composition Principles for Synthesis of Optimal Multistage Processes
• Contraction Mappings in the Theory Underlying Dynamic Programming
• Finite-State Processes and Dynamic Programming
• Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type
• Representation theorems for equivalent optimization problems

This page was built for publication: Classes of discrete optimization problems and their decision problems