Pages that link to "Item:Q3593371"
From MaRDI portal
The following pages link to Heuristic solutions for general concave minimum cost network flow problems (Q3593371):
Displaying 14 items.
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← links)
- A hybrid biased random key genetic algorithm approach for the unit commitment problem (Q405676) (← links)
- Global and local search algorithms for concave cost transshipment problems (Q811873) (← links)
- Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
- Global search algorithms for minimum concave-cost network flow problems (Q1200522) (← links)
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
- Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
- A deterministic annealing algorithm for the minimum concave cost network flow problem (Q1952548) (← links)
- The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach (Q2018861) (← links)
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure (Q2147939) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
- A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation (Q6079857) (← links)
- A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)
