The following pages link to (Q3544989):
Displaying 9 items.
- Convex integer maximization via Graver bases (Q1017675) (← links)
- Representations and characterizations of vertices of bounded-shape partition polytopes (Q1307294) (← links)
- An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
- Constrained clustering via diagrams: a unified theory and its application to electoral district design (Q1695008) (← links)
- Permutation polytopes corresponding to strongly supermodular functions (Q1878403) (← links)
- Partitioning a finite set by a dynamic programming method (Q1883748) (← links)
- One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions (Q2369976) (← links)
- Partitions. Optimality and clustering. Vol. II: Multi-parameter. (Q2842220) (← links)
- Explicit solution of partitioning problems over a 1-dimensional parameter space (Q4519922) (← links)
