Pages that link to "Item:Q5287447"

The following pages link to A polynomial time solvable concave network flow problem (Q5287447):

Displaying 21 items.

• Open questions in complexity theory for numerical optimization (Q687097) (← links)
• A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
• Global and local search algorithms for concave cost transshipment problems (Q811873) (← links)
• The binary network flow problem is logspace complete for P (Q914388) (← links)
• Strongly polynomial time algorithms for certain concave minimization problems on networks (Q1317011) (← links)
• Minimizing a linear multiplicative-type function under network flow constraints (Q1362518) (← links)
• An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks (Q1384224) (← links)
• Strong polynomial-time solvability of a minimum concave cost network flow problem. (Q1582279) (← links)
• A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
• The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← links)
• Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
• Probabilistic local search algorithms for concave cost transportation network problems (Q1806939) (← links)
• A concavity result for network design problems (Q1862177) (← links)
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
• Minimum concave cost flow over a grid network (Q2340279) (← links)
• On linear multiplicative programming. (Q2468549) (← links)
• On the computational complexity of minimum-concave-cost flow in a two-dimensional grid (Q2828332) (← links)
• Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) (← links)
• (Q5171710) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)