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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper we consider the single facility location problem with respect to a given set of existing facilities in the presence of an arc-shaped barrier. A barrier is considered a region where neither facility location nor travelling is permitted. We present a mixed-integer nonlinear programming model for this single facility location problem. The objective of this problem is to locate this single facility such that the sum of the rectilinear distances from the facility to the demand points is minimized. Test problems are presented to illustrate the applicability of the proposed model.

Nonlinear Programming Model For The Facility Location Problem In The Presence Of Arc-shaped Barrier