Strongly 2-shape-sortability of vector partitions

Huilan Chang and Junyi Guo

Journal of Combinatorial Optimization, 2006, vol. 11, issue 4, No 4, 407-410

Abstract: Abstract Partitioning points optimally in ℝ1 have been well studied. Hwang et al. (2003) first extended the optimal partitioning problems from ℝ1 to ℝ d . In particular, they studied the “sortability” of some partition properties. They also constructed examples to show that some partition properties, like Disjoint and Cone disjoint, are not sortable under some constraints 핊. In this note we construct a more concise example than theirs and also prove that another partition property, Nonpenetrating, is not sortable under 핊.

Keywords: Vector partition; Sortability; Optimality (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-8209-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:11:y:2006:i:4:d:10.1007_s10878-006-8209-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-006-8209-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().