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

This paper introduces a novel algorithm combination designed for fastone-to-many multicriteria shortest path search. A preprocessing algorithmexcludes irrelevant vertices by building a smaller cover graph. A modifiedversion of multicriteria label-setting algorithm operates on the cover graphand employs a dimensionality reduction technique for swifter domination checks.While the method itself maintains solution optimality, it is able toadditionally incorporate existing heuristics for further speedups. The proposedalgorithm has been tested on multiple criteria combinations of varyingcorrelation. The results show the introduced approach provides a speedup of atleast 6 times on simple criteria combinations and up to 60 times on hardinstances compared to vanilla multicriteria label-setting. Graph preprocessingalso decreases memory requirements of queries by up to 13 times.

Fast One-to-Many Multicriteria Shortest Path Search