Pages that link to "Item:Q1200522"
From MaRDI portal
The following pages link to Global search algorithms for minimum concave-cost network flow problems (Q1200522):
Displayed 11 items.
- An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
- Parallel computing in nonconvex programming (Q1309859) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← 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)
- Algorithms for Finding Optimal Flows in Dynamic Networks (Q2974407) (← links)
- Facility location and capacity acquisition: An integrated approach (Q4859573) (← links)
- Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
- A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)