Pages that link to "Item:Q688207"
From MaRDI portal
The following pages link to Linear time algorithms for some separable quadratic programming problems (Q688207):
Displayed 8 items.
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485) (← links)
- Quadratic resource allocation with generalized upper bounds (Q1376263) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- Minimizing the sum of the \(k\) largest functions in linear time. (Q1853685) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Hybrid rounding techniques for knapsack problems (Q2489957) (← links)