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 the recent paper \cite{BDT10} we introduced a new problem that we call BinPacking/Covering with Delivery, or BP/CD for short. Mainly we mean under thisexpression that we look for not only a good, but a "good and fast" packing orcovering. In that paper we mainly dealt with only one possible online BP/CDmodel, and proposed a new method that we call the Evolution of Algorithms. Incase of such methods a neighborhood structure is defined among algorithms, andusing a metaheuristic (for example simulated annealing) in some sense the bestalgorithm is chosen to solve the problem. Now we turn to investigate theoffline case. We define several ways to treat such a BP/CD problem, although weinvestigate only one of them here. For the analysis, a novel view on "offlineoptimum" is introduced, which appears to be relevant concerning all problemswhere a final solution is ordering-dependent. We prove that if the item sizesare not allowed to be arbitrarily close to zero, then an optimal offlinesolution can be found in polynomial time. On the other hand, for unrestrictedproblem instances, no polynomial-time algorithm can achieve an approximationratio better than 6/7 if $P\ne NP$.

Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms