<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

Partition polytopes over 1-dimensional points

dc.citation.epage362en_US
dc.citation.issue2en_US
dc.citation.spage335en_US
dc.citation.volume85en_US
dc.citation.woscount7
dc.contributor.authorGao, Ben_US
dc.contributor.authorHwang, FKen_US
dc.contributor.authorLi, WCWen_US
dc.contributor.authorRothblum, UGen_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.date.accessioned2014-12-08T15:46:34Z
dc.date.available2014-12-08T15:46:34Z
dc.date.issued1999-06-01en_US
dc.description.abstractWe consider partitions of a finite set whose elements are associated with a single numerical attribute. For each partition we consider the vector obtained by taking the sums of the attributes corresponding to the elements in the parts (sets) of the partition, and we study the convex hulls of sets of such vectors. For sets of all partitions with prescribed number of elements in each set, we obtain a characterizing system of linear inequalities and an isomorphic representation of the face lattice. The relationship of the resulting class of polytopes to that of generalized permutahedra is explored.en_US
dc.identifier.doi10.1007/s10107990019aen_US
dc.identifier.issn0025-5610en_US
dc.identifier.journalMATHEMATICAL PROGRAMMINGen_US
dc.identifier.urihttp://dx.doi.org/10.1007/s10107990019aen_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/31316
dc.identifier.wosnumberWOS:000081703000006
dc.language.isoen_USen_US
dc.subjectpartitionsen_US
dc.subjectpolytopesen_US
dc.subjectsupermodular functionsen_US
dc.subjectsystem-assemblyen_US
dc.titlePartition polytopes over 1-dimensional pointsen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
000081703000006.pdf
Size:
234.29 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: