Pages that link to "Item:Q1804581"
From MaRDI portal
The following pages link to The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581):
Displaying 21 items.
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- The minimal average cost flow problem (Q1130071) (← links)
- An algorithm for a concave production cost network flow problem (Q1301576) (← 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)
- An algorithm for solving the transport problem on network with concave cost functions of flow on edges (Q1397637) (← links)
- Polynomial algorithms for a class of minimum rank-two cost path problems (Q1567071) (← links)
- Strong polynomial-time solvability of a minimum concave cost network flow problem. (Q1582279) (← 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 seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems (Q2423820) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid (Q2828332) (← links)
- (Q3802861) (← links)
- Analysis of a flow problem with fixed charges (Q3827774) (← links)
- New formulation and relaxation to solve a concave-cost network flow problem (Q4367015) (← links)
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems (Q4419278) (← links)
- Minimum cost flow in a network with an overestimated arc capacity (Q4973760) (← links)
- Subdeterminants and Concave Integer Quadratic Programming (Q5206942) (← links)
- A polynomial time solvable concave network flow problem (Q5287447) (← links)