Optimizing some constructions with bars: new geometric knapsack problems

DOI10.1007/s10878-014-9816-zzbMath1362.90318OpenAlexW2036438899MaRDI QIDQ266044

Jorge Urrutia, Stefan Langerman, Sergey Bereg, Pablo Pérez-Lantero, José-Miguel Díaz-Báñez, David Flores-Peñaloza

Publication date: 13 April 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/231087/3/umbrellasrevised.pdf

zbMATH Keywords

inequalitiescombinatorial optimizationgeometric optimizationoptimal algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Geometric Knapsack problems
• Covering point sets with two disjoint disks or squares
• Optimal placement of convex polygons to maximize point containment
• Unnamed Item
• Unnamed Item
• Unnamed Item