Pages that link to "Item:Q1850111"
From MaRDI portal
The following pages link to Vertex characterization of partition polytopes of bipartitions and of planar point sets (Q1850111):
Displaying 12 items.
- On the vertex characterization of single-shape partition polytopes (Q411234) (← links)
- Some efficiently solvable problems over integer partition polytopes (Q476314) (← links)
- The partition problem for equifacetal simplices (Q1005909) (← links)
- Optimal partitions having disjoint convex and conic hulls (Q1190601) (← links)
- Representations and characterizations of vertices of bounded-shape partition polytopes (Q1307294) (← links)
- Are there more almost separable partitions than separable partitions? (Q2015797) (← links)
- Counting disjoint 2-partitions for points in the plane (Q2384393) (← links)
- Sphere-separable partitions of multi-parameter elements (Q2478428) (← links)
- Polytopes of partitions of numbers (Q2567201) (← links)
- The vector partition problem for convex objective functions. (Q2757683) (← links)
- Polynomial traffic demand polytope partitioning (Q2861541) (← links)
- Good Clusterings Have Large Volume (Q4971590) (← links)
