Heuristics for the 0–1 min-knapsack problem
Acta Cybernetica
Algorithms for solving the single-sink fixed-charge transportation problem
Computers and Operations Research
Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem
Operations Research Letters
Bandwidth constrained multi-interface networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Dynamic service placement in shared service hosting infrastructures
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
| Hi-index | 0.00 |
The single-sink fixed-charge transportation problem (SSFCTP) consists of finding a minimum cost flow from a number of nodes to a single sink. Beside a cost proportional to the amount shipped, the flow cost encompass a fixed charge. The SSFCTP is an important subproblem of the well-known fixed-charge transportation problem. Nevertheless, just a few methods for solving this problem have been proposed in the literature. In this paper, some greedy heuristic solutions methods for the SSFCTP are investigated. It is shown that two greedy approaches for the SSFCTP known from the literature can be arbitrarily bad, whereas an approximation algorithm proposed in the literature for the binary min-knapsack problem has a guaranteed worst case bound if adapted accordingly to the case of the SSFCTP.