包裝問題
Sign in to saveclass of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible
In the Vinony graph
Within Vinony's link graph, 包裝問題 is referenced by 304 other articles, and connects out to square packing in a square, close-packing of equal spheres and kissing number problem.
It is catalogued under the topic Packing problems.
Its subject is documented across 10 Wikipedia language editions.
Wikidata facts
- Subclass of
- optimization problem
- Image
- Citrus fruits.jpg
Show 4 more facts
- different from
- knapsack problem
- topic's main category
- Category:Packing problems
- Commons category
- Packing problems
- maintained by WikiProject
- WikiProject Mathematics
Sources (2)
via Wikidata · CC0
Connections
square packing in a square
Entity
close-packing of equal spheres
Entity
kissing number problem
Entity
mathematics
Entity
area
Entity
International Standard Book Number
Entity
natural number
Entity
circle
Entity
integer
Entity
function
Entity
volume
Entity
rectangle
Entity
riddle
Entity
sphere
Entity
polygon
Entity
cube
Entity
mathematical proof
Entity
digital object identifier
Entity
cylinder
Entity
International Standard Serial Number
Entity