Pages that link to "Item:Q3984287"
From MaRDI portal
The following pages link to Approximate solutions of capacitated fixed-charge minimum cost network flow problems (Q3984287):
Displayed 12 items.
- A generalized bi-criteria fuzzy integer flow sharing problem (Q448933) (← links)
- Mathematical models for selection of optimal place and size of connections considering the time-value of money (Q1044096) (← links)
- A dual ascent approach to the fixed-charge capacitated network design problem (Q1278408) (← links)
- An algorithm for a concave production cost network flow problem (Q1301576) (← links)
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360) (← links)
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure (Q2147939) (← links)
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems (Q2479831) (← links)
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation (Q2505552) (← links)
- COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
- Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)