Pages that link to "Item:Q1317011"

The following pages link to Strongly polynomial time algorithms for certain concave minimization problems on networks (Q1317011):

Displaying 18 items.

• A parametric algorithm for convex cost network flow and related problems (Q789313) (← links)
• A fast polynomial time algorithm for logistics network flows (Q924394) (← links)
• An algorithm for a concave production cost network flow problem (Q1301576) (← links)
• Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
• Minimizing a linear multiplicative-type function under network flow constraints (Q1362518) (← links)
• A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
• Strong polynomial-time solvability of a minimum concave cost network flow problem. (Q1582279) (← links)
• Bounds for global optimization of capacity expansion and flow assignment problems (Q1591547) (← links)
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
• A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
• A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (Q2479840) (← links)
• Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (Q4540090) (← links)
• Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) (← links)
• (Q4952722) (← links)
• A polynomial time solvable concave network flow problem (Q5287447) (← links)
• Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)