Optimizing some constructions with bars: new geometric knapsack problems

DOI10.1007/S10878-014-9816-ZzbMATH Open1362.90318OpenAlexW2036438899MaRDI QIDQ266044FDOQ266044

Authors: Sergey Bereg, Stefan Langerman, P. Pérez-Lantero, J. Urrutia, J. M. Díaz-Báñez, D. 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

Recommendations

• scientific article; zbMATH DE number 177546
• Geometric Knapsack problems
• Approximating Geometric Knapsack via L-packings
• Knapsack polytopes: a survey
• On a combinatorial structure of the problems of optimal packing of geometric objects
• On the solution of concave knapsack problems
• Knapsack problems: a parameterized point of view
• Some new results on multi-dimension Knapsack problem
• A note on optimal solutions to quadratic knapsack problems
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls

zbMATH Keywords

combinatorial optimizationinequalitiesgeometric optimizationoptimal algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Optimal placement of convex polygons to maximize point containment
• Title not available (Why is that?)
• Title not available (Why is that?)
• Geometric Knapsack problems
• Covering point sets with two disjoint disks or squares

Cited In (3)

• Title not available (Why is that?)
• Geometric Knapsack problems
• Complexity results for the horizontal bar packing problem

This page was built for publication: Optimizing some constructions with bars: new geometric knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266044)