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

The Chinese Postman problem is well solved when the original graph contains only arcs or only edges. The mixed chinese Postman Problem (MCPP) is however NP-complete and very few papers have been devoted to this problem. In this paper, the authors present a new integer programming model and a new optimal algorithm for the MCPP. The simplex method is used iteratively to obtain sharp lower bounds by solving successive relaxations of this model. Optimality is achieved by using Gomory cuts, blossom inequalities and balanced set constraints. Elaborate computer results are presented. (A)

An optimal algorithm for the mixed Chinese postman problem