Pages that link to "Item:Q2757683"
From MaRDI portal
The following pages link to The Vector Partition Problem for Convex Objective Functions (Q2757683):
Displayed 8 items.
- 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)
- 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)