Pages that link to "Item:Q2277131"
From MaRDI portal
The following pages link to Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131):
Displaying 12 items.
- Strongly polynomial algorithm for a production-transportation problem with concave production cost (Q3835663) (← links)
- Capacity improvement, penalties, and the fixed charge transportation problem (Q4261216) (← links)
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems (Q4419278) (← links)
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (Q4540090) (← links)
- Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) (← links)
- (Q4845364) (← links)
- Subdeterminants and Concave Integer Quadratic Programming (Q5206942) (← links)
- Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
- The plant location and flexible technology acquisition problem. (Q5953331) (← links)
- An integrated model for facility location and technology acquisition (Q5959383) (← links)
- Avoiding unnecessary demerging and remerging of multi‐commodity integer flows (Q6092659) (← links)
- A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)