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, we show $O(1.415^n)$-time and $O(1.190^n)$-space exactalgorithms for 0-1 integer programs where constraints are linear equalities andcoefficients are arbitrary real numbers. Our algorithms are quadraticallyfaster than exhaustive search and almost quadratically faster than an algorithmfor an inequality version of the problem by Impagliazzo, Lovett, Paturi andSchneider (arXiv:1401.5512), which motivated our work. Rather than improvingthe time and space complexity, we advance to a simple direction as inclusion ofmany NP-hard problems in terms of exact exponential algorithms. Specifically,we extend our algorithms to linear optimization problems.

Exact Algorithms for 0-1 Integer Programs with Linear Equality Constraints