The Max Static K-Sinks Location Problem

Authors

  • Hari Nandan Nath

DOI:

https://doi.org/10.3126/ijorn.v10i1.54730

Keywords:

Network flow, static flow, shelter location, multiple sinks

Abstract

The maximum static flow problem sends a maximum amount of flow from a set of sources to a set of
sinks in a network with multiple sources and multiple sinks. Because of cost or other constraints, e.g.
in evacuation planning, only a limited number of sinks may have to be chosen. To address such an
issue, we consider a problem of choosing a set of at most a given number of sinks from a given set of
possible sinks T as a Max Static k-sinks problem. We present a non-polynomial time algorithm to solve
it and show that (T – 1)-sinks problem can be solved in a strongly polynomial time

Downloads

Download data is not yet available.
Abstract
24
PDF
23

Downloads

Published

2023-05-08

How to Cite

Nath, H. N. (2023). The Max Static K-Sinks Location Problem. International Journal of Operational Research/Nepal, 10(1), 47–52. https://doi.org/10.3126/ijorn.v10i1.54730

Issue

Vol. 10 No. 1 (2022)

Section

Articles

License

Copyright (c) 2023 International Journal of Operational Research/Nepal

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

CC BY: This license allows reusers to distribute, remix, adapt, and build upon the material in any medium or format, so long as attribution is given to the creator. The license allows for commercial use.