An approximative algorithm for the fixed charge problem
From MaRDI portal
Cites work
Cited in
(18)- A vertex ranking algorithm for the fixed-charge transportation problem
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- Quasi-concave minimization subject to linear constraints
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Exact algorithm for solving a special fixed-charge linear programming problem
- COAL: A new heuristic approach for solving the fixed charge problem - computational results
- Fractional polynomial bounds for the fixed charge problem
- A heuristic algorithm for the fixed charge problem
- COLE: a new heuristic approach for fixed charge problem computational results
- scientific article; zbMATH DE number 4147878 (Why is no real title available?)
- Degeneracy in fixed cost transportation problems
- An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem
- A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production
- The fixed charge problem
- The fractional fixed-charge problem
- Fixed charge problems with identical fixed charges
This page was built for publication: An approximative algorithm for the fixed charge problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5580061)
