Pages that link to "Item:Q1582279"

The following pages link to Strong polynomial-time solvability of a minimum concave cost network flow problem. (Q1582279):

Displaying 8 items.

• Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
• Strongly polynomial time algorithms for certain concave minimization problems on networks (Q1317011) (← links)
• A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
• A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
• (Q4952722) (← links)
• A polynomial time solvable concave network flow problem (Q5287447) (← links)
• Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q5415463) (← links)