Bundling Problems in Geometric Optimization
- Title
- Bundling Problems in Geometric Optimization
- Authors
- 박동우
- Date Issued
- 2017
- Publisher
- 포항공과대학교
- Abstract
- Arranging objects is an important and fundamental problem in many fields of industry such as packaging and logistics.
Bundling is one frequently used method to arrange objects.
Given $k$ geometric objects in $\mathbb{R}^d$, the bundling problem asks to find transformations of the given objects such that the size of the convex hull of the objects is minimized while they remain disjoint in their interiors.
In this thesis, we study three variants of bundling problem according to the following criteria: 1) the number, 2) the dimension, 3) the complexity of the given objects. We propose efficient algorithms for these bundling problems.
- URI
- http://postech.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002327008
https://oasis.postech.ac.kr/handle/2014.oak/93531
- Article Type
- Thesis
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.