Pages that link to "Item:Q4702337"
From MaRDI portal
The following pages link to A Polynomial Time Algorithm for Shaped Partition Problems (Q4702337):
Displaying 20 items.
- On the number of separable partitions (Q491209) (← links)
- The mean-partition problem (Q857804) (← links)
- Nonlinear bipartite matching (Q924630) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- Separable partitions (Q1283783) (← links)
- The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. (Q1408266) (← links)
- Linear-shaped partition problems (Q1577471) (← links)
- An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
- Efficient solutions for weight-balanced partitioning problems (Q1751164) (← links)
- Complexity and approximation of finding the longest vector sum (Q1785063) (← links)
- Vertex characterization of partition polytopes of bipartitions and of planar point sets (Q1850111) (← links)
- On the number of corner cuts (Q1865258) (← links)
- Are there more almost separable partitions than separable partitions? (Q2015797) (← links)
- The complexity of vector partition (Q2155634) (← links)
- Counting disjoint 2-partitions for points in the plane (Q2384393) (← links)
- Convex integer optimization by constantly many linear counterparts (Q2451653) (← links)
- The use of edge-directions and linear programming to enumerate vertices (Q2471066) (← links)
- The partition bargaining problem (Q2473040) (← links)
- Sphere-separable partitions of multi-parameter elements (Q2478428) (← links)
- Screening multi‐dimensional heterogeneous populations for infectious diseases under scarce testing resources, with application to <scp>COVID</scp>‐19 (Q6053041) (← links)
