Pages that link to "Item:Q4419278"

The following pages link to Upper bounds for single-source uncapacitated concave minimum-cost network flow problems (Q4419278):

Displaying 11 items.

• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← links)
• Global search algorithms for minimum concave-cost network flow problems (Q1200522) (← links)
• Algorithms for the single-source uncapacitated minimum concave-cost network flow problem (Q1200636) (← 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)
• A heuristic algorithm for a network problem with variable upper bounds (Q3199211) (← links)
• Heuristic solutions for general concave minimum cost network flow problems (Q3593371) (← links)
• Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks (Q6160230) (← links)