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

We solve the time dependent shortest path problem. This problem consists in finding a minimum weight path through a network with respect to time windows constraints, and time varying costs and travelling times. Two issues of this problem are studied: without and with a knapsack type constraint. We show an important application of this problem for the design of an optimal column generation based algorithm for a time dependent vehicle routing problem.

Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées