Pages that link to "Item:Q3835663"

The following pages link to Strongly polynomial algorithm for a production-transportation problem with concave production cost (Q3835663):

Displaying 9 items.

• Minimizing a linear multiplicative-type function under network flow constraints (Q1362518) (← links)
• A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem (Q1365379) (← links)
• A strongly polynomial algorithm for the transportation problem (Q1804365) (← 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)
• Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs (Q2811304) (← links)
• (Q3115579) (← links)
• Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)