Pages that link to "Item:Q2802141"

The following pages link to A polynomial-time descent method for separable convex optimization problems with linear constraints (Q2802141):

Displaying 9 items.

• Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
• Algorithms for separable convex optimization with linear ascending constraints (Q1628287) (← links)
• 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)
• Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems (Q3503231) (← links)
• Using separation algorithms in fixed dimension (Q3990616) (← links)
• (Q5075765) (← links)
• Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation (Q6487347) (← links)