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

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this article, we study a biobjective extension of the shortest pathnetwork interdiction problem. Each arc in the network is associated with twointeger length values and two players compute their respective shortest pathsfrom source to sink independently from each other while an interdictor tries tolengthen both shortest paths by removing arcs. We show that this problem isintractable and that deciding whether a feasible interdiction strategy isefficient, is NP- complete. We provide a solution procedure to solve theproblem on two-terminal series-parallel graphs in pseudopolynomial time.

The two player shortest path network interdiction problem