Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Knapsack problem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Geometric === In the '''geometric knapsack problem''', there is a set of rectangles with different values, and a rectangular knapsack. The goal is to pack the largest possible value into the knapsack.<ref>{{Cite journal|last1=Galvez|first1=Waldo|last2=Grandoni|first2=Fabrizio|last3=Ingala|first3=Salvatore|last4=Heydrich|first4=Sandy|last5=Khan|first5=Arindam|last6=Wiese|first6=Andreas|date=2021|title=Approximating Geometric Knapsack via L-packings|url=https://doi.org/10.1145/3473713|pages=33:1β33:67|doi=10.1145/3473713|journal = ACM Trans. Algorithms|volume=17 |issue=4 |arxiv=1711.07710}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)