Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems
From MaRDI portal
Recommendations
- A tabu search heuristic procedure for the fixed charge transportation problem
- A heuristic algorithm for the fixed charge problem
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- Heuristic algorithms for the fixed-charge transportation problem
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem
Cited in
(10)- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Solving fixed charge transportation problem with truck load constraint using metaheuristics
- A genetic algorithm for solving the fixed-charge transportation model: two-stage problem
- 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
- COLE: a new heuristic approach for fixed charge problem computational results
- scientific article; zbMATH DE number 146408 (Why is no real title available?)
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
This page was built for publication: Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984310)