Pages that link to "Item:Q1926652"
From MaRDI portal
The following pages link to Equivalence of convex minimization problems over base polytopes (Q1926652):
Displaying 4 items.
- A fast algorithm for quadratic resource allocation problems with nested constraints (Q2669547) (← links)
- On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
- Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) (← links)
- Lexicographically optimal earliest arrival flows (Q6068531) (← links)