Abstract
In this paper the multi terminal q-FlowLoc problem (q-MT-FlowLoc) is introduced. FlowLoc problems combine two well-known modeling tools: (dynamic) network flows and locational analysis. Since the q-MT-FlowLoc problem is NP-hard we give a mixed integer programming formulation and propose a heuristic which obtains a feasible solution by calculating a maximum flow in a special graph H. If this flow is also a minimum cost flow, various versions of the heuristic can be obtained by the use of different cost functions. The quality of this solutions is compared. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Heller, S., & Hamacher, H. W. (2011). The multi terminal q-FlowLoc problem: A heuristic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6701 LNCS, pp. 523–528). https://doi.org/10.1007/978-3-642-21527-8_57
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
