Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Optimal substructure · Vinony

🌐English

English Italiano Polski Tiếng Việt فارسی ไทย 中文日本語

EntityQ2333568· pop 8· linked from 12 articles

Optimal substructure

property of a computational problem

Available in 8 languages

Italiano
Czech
Polski
Tiếng Việt
Ukrainian
فارسی
ไทย

via Wikidata sitelinks · CC0

Connections

dynamic programming

Bellman equation

Categories

Dynamic programming

computer science

Entity

International Standard Book Number

mathematical optimization

partition of a set

divide-and-conquer algorithm

greedy algorithm

Richard E. Bellman

shortest path problem

glossary of graph theory terms

longest common subsequence problem

Charles E. Leiserson

Thomas H. Cormen

longest increasing subsequence

longest path problem

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

optimization problem

Entitydist 0.38

combinatorial optimization

Entitydist 0.46

convex optimization

Entitydist 0.48

discrete optimization

Entitydist 0.49

Bruck–Ryser–Chowla theorem

Entitydist 0.56

best-first search

Entitydist 0.58

Entitydist 0.59

memetic algorithm

Entitydist 0.61

Entitydist 0.61

Entitydist 0.62

Erdős–Stone theorem

Entitydist 0.63

empirical risk minimization

Entitydist 0.70

What links here12 pages

longest common subsequence problem

Bellman equation

dynamic programming

constraint programming