Pages that link to "Item:Q2494473"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for concave network flow problems (Q2494473):
Displaying 13 items.
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← links)
- A specialized network simplex algorithm for the constrained maximum flow problem (Q531424) (← links)
- An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
- A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
- Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks (Q1384224) (← links)
- A deterministic annealing algorithm for the minimum concave cost network flow problem (Q1952548) (← links)
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems (Q2423820) (← links)
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems (Q2468881) (← links)
- Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- A hybrid algorithm for solving convex separable network flow problems (Q3706799) (← links)
- Network Flow Optimization with Minimum Quantities (Q5232831) (← links)
