Pages that link to "Item:Q2802141"
From MaRDI portal
The following pages link to A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141):
Displaying 4 items.
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan (Q2338217) (← links)
- (Q5075765) (← links)
