An approximative algorithm for the fixed-charges transportation problem
From MaRDI portal
Cited in
(21)- On the use of tree indexing methods in transportation algorithms
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A set covering reformulation of the pure fixed charge transportation problem
- A tabu search heuristic procedure for the fixed charge transportation problem
- Probabilistic local search algorithms for concave cost transportation network problems
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- A heuristic algorithm for the fixed charge problem
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- COLE: a new heuristic approach for fixed charge problem computational results
- Linear-time approximation for maximum weight matching
- The pure fixed charge transportation problem
- A systematic extreme point enumeration procedure for fixed charge problem
- Degeneracy in fixed cost transportation problems
- An algorithm for solving fixed charge bi-criterion transportation problem with restricted flow
- An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem
- An approximative algorithm for the fixed charge problem
- On the fixed cost flow problem†
- The transportation problem with packing constraints
- Global and local search algorithms for concave cost transshipment problems
This page was built for publication: An approximative algorithm for the fixed-charges transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3845817)
