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 paper the problem of selecting $p$ out of $n$ available items isdiscussed, such that their total cost is minimized. We assume that costs arenot known exactly, but stem from a set of possible outcomes.  Robust recoverable and two-stage models of this selection problem areanalyzed. In the two-stage problem, up to $p$ items is chosen in the firststage, and the solution is completed once the scenario becomes revealed in thesecond stage. In the recoverable problem, a set of $p$ items is selected in thefirst stage, and can be modified by exchanging up to $k$ items in the secondstage, after a scenario reveals.  We assume that uncertain costs are modeled through bounded uncertainty sets,i.e., the interval uncertainty sets with an additional linear (budget)constraint, in their discrete and continuous variants. Polynomial algorithmsfor recoverable and two-stage selection problems with continuous boundeduncertainty, and compact mixed integer formulations in the case of discretebounded uncertainty are constructed.

On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty