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

The intention of this note is two-fold. First, we study integer optimizationproblems in standard form defined by $A \in\mathbb{Z}^{m\times{}n}$ and presentan algorithm to solve such problems in polynomial-time provided that both thelargest absolute value of an entry in $A$ and $m$ are constant. Then, this isapplied to solve integer programs in inequality form in polynomial-time, wherethe absolute values of all maximal sub-determinants of $A$ lie between $1$ anda constant.

A Note on Non-Degenerate Integer Programs with Small Sub-Determinants