A branch-and-bound method for the fixed charge transportation problem
Management Science
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Exact algorithm for solving a special fixed-charge linear programming problem
Journal of Optimization Theory and Applications
Heuristics for the 0–1 min-knapsack problem
Acta Cybernetica
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
Management Science
Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem
Operations Research Letters
Computers and Industrial Engineering
A genetic algorithm based heuristic to the multi-period fixed charge distribution problem
Applied Soft Computing
Fixed-Charge Transportation with Product Blending
Transportation Science
Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm
Computers and Industrial Engineering
| Hi-index | 0.01 |
The single-sink fixed-charge transportation problem is an important subproblem of the fixed-charge transportation problem. Just a few methods have been proposed in the literature to solve this problem. In this paper, solution approaches based on dynamic programming and implicit enumeration are revisited. It is shown how the problem size as well as the search space of a recently published dynamic programming method can be reduced by exploiting reduced cost information. Additionally, a further implicit enumeration approach relying on solution concepts for the binary knapsack problem is introduced. The performance of the various solution methods is compared in a series of computational experiments.