Pages that link to "Item:Q1200636"
From MaRDI portal
The following pages link to Algorithms for the single-source uncapacitated minimum concave-cost network flow problem (Q1200636):
Displaying 11 items.
- An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
- Network flow problems and permutationally concave games (Q1042338) (← links)
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks (Q1384224) (← links)
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure (Q2147939) (← links)
- Single-path routing of stochastic flows in networks (Q2275571) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- Strongly polynomial algorithm for a production-transportation problem with concave production cost (Q3835663) (← links)
- Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) (← links)
- Subdeterminants and Concave Integer Quadratic Programming (Q5206942) (← links)
- Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
