English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this paper we propose a new efficient linear programming based approachfor multi-resource allocation and location problems in disaster management.Such problems require an integer solution and therefore, in most cases, thecomputations rely on integer and mixed-integer linear programming solvers. Ingeneral, these solvers can not handle large scaled problem. In this paper wedemonstrate that there exists a large class of disaster management problemswhose exact solutions can be obtained by applying the simplex method (linearprogramming). The results of numerical experiments are provided. Anotherimportant contribution of this paper is related to general cluster analysis andallocation. Namely, we demonstrate that the classical $k$-medoid clusteringmethod can be implemented using linear programming techniques (simplex method)without relying on integer solvers.

Solving multi-resource allocation and location problems in disaster management through linear programming