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

Block elimination algorithms for solving sparse discrete optimizationproblems are considered. The numerical example is provided. The benchmarking isdone in order to define real computational capabilities of block eliminationalgorithms combined with SYMPHONY solver. Analysis of the results show that forsufficiently large number of blocks and small enough size of separators betweenthe blocks for staircase integer linear programming problem the localelimination algorithms in combination with a solver for solving subproblems inblocks allow to solve such problems much faster than used solver itself forsolving the whole problem. Also the capabilities of postoptimal analysis (warmstarting) are considered for solving packages of integer linear programmingproblems for corresponding blocks.

Block local elimination algorithms for solving sparse discrete optimization problems