Pages that link to "Item:Q5929388"
From MaRDI portal
The following pages link to Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks. (Q5929388):
Displayed 6 items.
- Fractional routing using pairs of failure-disjoint paths (Q496701) (← links)
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
- A branch-and-bound algorithm for concave network flow problems (Q2494473) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks (Q6160230) (← links)