The following pages link to (Q3626256):
Displaying 10 items.
- A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
- Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
- Approximation of convex curves with application to the bicriterial minimum cost flow problem (Q1825606) (← links)
- A deterministic annealing algorithm for the minimum concave cost network flow problem (Q1952548) (← links)
- Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks (Q2757586) (← links)
- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem (Q3046506) (← links)
- (Q3802861) (← links)
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems (Q4419278) (← links)
- (Q5294046) (← links)