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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We consider a wide class of the discrete optimization problems with intervalobjective function. We give a generalization of the greedy algorithm for theproblems. Using the algorithm, we obtain the set of all possible greedysolutions and the set of all possible values of the objective function for thesolutions. For a given probability distribution on intervals of objectivefunction' coefficients, we compute probabilities of the solutions, computeexpected values of the objective function for them and other probabilisticcharacteristics of the problem.

The interval greedy algorithm for discrete optimization problems with interval objective function