The following pages link to Geometric Knapsack problems (Q689105):
Displayed 9 items.
- Optimizing some constructions with bars: new geometric knapsack problems (Q266044) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Peeling meshed potatoes (Q534778) (← links)
- Bounds for point recolouring in geometric graphs (Q924089) (← links)
- Counting convex polygons in planar point sets (Q1350236) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- Minimum perimeter-sum partitions in the plane (Q2291459) (← links)
- Delineating boundaries for imprecise regions (Q2479529) (← links)
- Exact and heuristic solutions for the prize‐collecting geometric enclosure problem (Q6154939) (← links)