Pages that link to "Item:Q2029899"

The following pages link to A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899):

Displaying 7 items.

• An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
• An adaptive nonmonotone line search for multiobjective optimization problems (Q2669601) (← links)
• Solving nonsmooth and discontinuous optimal power flow problems via interior-point \(\ell_p\)-penalty approach (Q2669712) (← links)
• Multi-market portfolio optimization with conditional value at risk (Q2670592) (← links)
• Implementing an “exact” Newton method for separable convex transportation problems (Q3827809) (← links)
• Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)
• Direct solution of the normal equations in interior point methods for convex transportation problems (Q6556159) (← links)