Pages that link to "Item:Q2757683"
From MaRDI portal
The following pages link to The Vector Partition Problem for Convex Objective Functions (Q2757683):
Displaying 17 items.
- On the number of separable partitions (Q491209) (← links)
- Nonlinear bipartite matching (Q924630) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- Graphs of transportation polytopes (Q1040845) (← links)
- The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. (Q1408266) (← links)
- An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
- The complexity of vector partition (Q2155634) (← links)
- The use of edge-directions and linear programming to enumerate vertices (Q2471066) (← links)
- Sphere-separable partitions of multi-parameter elements (Q2478428) (← links)
- On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705) (← links)
- On the Complexity of the Minimum Independent Set Partition Problem (Q3196378) (← links)
- Approximability of the Problem of Finding a Vector Subset with the Longest Sum (Q4973237) (← links)
- Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm (Q5091037) (← links)
- An exact algorithm for finding a vector subset with the longest sum (Q5374013) (← links)
- Complexity and algorithms for finding a subset of vectors with the longest sum (Q5918111) (← links)
- Screening multi‐dimensional heterogeneous populations for infectious diseases under scarce testing resources, with application to <scp>COVID</scp>‐19 (Q6053041) (← links)
