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.

Sırt çantası problemi · Vinony

Home
Combinatorial optimization
Sırt çantası problemi

🌐Türkçe

English Deutsch Español Français Italiano Nederlands Polski Português Svenska Tiếng Việt Türkçe Русский العربية فارسی ไทย 한국어 中文日本語

EntityQ864457· pop 31· linked from 84 articles

Sırt çantası problemi

Also known as rucksack problem, backpack problem

problem in combinatorial optimization

Wikidata facts

Image: Knapsack.svg

Sources (2)

wikidata.org
docs.openalex.org

via Wikidata · CC0

Available in 31 languages

Español
Français
Deutsch
中文
日本語
Русский
Português
Italiano
العربية
Armenian

Connections

polynomial-time approximation scheme

pseudo-polynomial time

Categories

Combinatorial optimization Cryptography Dynamic programming NP-complete problems Packing problems Pseudo-polynomial time algorithms Weakly NP-complete problems

Sources

wikipedia.externallinksexternallink

Show 12 more

Nederlands
Polski
Romanian
Serbian
Slovenian
Svenska
Tiếng Việt
Türkçe
Ukrainian
فارسی
ไทย
한국어

via Wikidata sitelinks · CC0

International Standard Book Number

Entity

rational number

Wayback Machine

digital object identifier

International Standard Serial Number

greatest common divisor

parallel computing

public-key cryptography

binary search algorithm

Sign in to save

What links here84 pages

glossary of group theory

packing problem

change-making problem

approximation algorithm

memetic algorithm

computational complexity

George Bernard Dantzig

subset sum problem

ant colony optimization algorithms

bin packing problem

P versus NP problem

Vickrey–Clarke–Groves auction

pseudo-polynomial time

Numbers, season 3

birthday problem

computational complexity theory

greedy algorithm

search algorithm

strong NP-completeness

Merkle–Hellman knapsack cryptosystem

genetic algorithm

Similar entities

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

assignment problem

Entitydist 0.26

Ménage problem

Entitydist 0.36

Steiner tree problem

Entitydist 0.48

bargaining problem

Entitydist 0.51

Three Prisoners problem

Entitydist 0.55

100 prisoners problem

Entitydist 0.56

Entitydist 0.61

Category:Inventory optimization

Entitydist 0.62

kobon triangle problem

Entitydist 0.63

marginal profit

Entitydist 0.64

Entitydist 0.64

polynomial-time reduction

Entitydist 0.66