scientific article; zbMATH DE number 3393931

zbMath0248.90044MaRDI QIDQ5661328

Jaroslav Morávek

Publication date: 1972

Full work available at URL: https://eudml.org/doc/27815

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (3)

Time and space complexity of deterministic and nondeterministic decision trees ⋮ Discrete extremal problems ⋮ Algebraic decision trees and Euler characteristics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note upon minimal path problem
• Linear Inequalities and Related Systems. (AM-38)
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Paths, Trees, and Flowers
• On the complexity of discrete programming problems

This page was built for publication: