Pages that link to "Item:Q4419278"
From MaRDI portal
The following pages link to Upper bounds for single-source uncapacitated concave minimum-cost network flow problems (Q4419278):
Displayed 7 items.
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← links)
- A deterministic annealing algorithm for the minimum concave cost network flow problem (Q1952548) (← links)
- The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach (Q2018861) (← 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)