Pages that link to "Item:Q5753748"
From MaRDI portal
The following pages link to Convex separable optimization is not much harder than linear optimization (Q5753748):
Displaying 4 items.
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (Q4581762) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
