Pages that link to "Item:Q5403991"
From MaRDI portal
The following pages link to Minimum cost network flows: Problems, algorithms, and software (Q5403991):
Displayed 8 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem (Q1615965) (← links)
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems (Q1652102) (← links)
- Complexity of strict robust integer minimum cost flow problems: an overview and further results (Q1725614) (← links)
- A network simplex method for the budget-constrained minimum cost flow problem (Q1751898) (← links)
- A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems (Q1753628) (← links)
- An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment (Q2225554) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)