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
14
PDF
18

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

Section

Articles