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

Virtual machine consolidation describes the process of reallocation ofvirtual machines (VMs) on a set of target servers. It can be formulated as amixed integer linear programming problem which is proven to be an NP-hardproblem. In this paper, we propose a kernel search (KS) heuristic algorithmbased on hard variable fixing to quickly obtain a high-quality solution forlarge-scale virtual machine consolidation problems (VMCPs). Since variablefixing strategies in existing KS works may make VMCP infeasible, our proposedKS algorithm employs a more efficient strategy to choose a set of fixedvariables according to the corresponding reduced cost. Numerical results onVMCP instances demonstrate that our proposed KS algorithm significantlyoutperforms the state-of-the-art mixed integer linear programming solver interms of CPU time, and our proposed strategy of variable fixing significantlyimproves the efficiency of the KS algorithm as well as the degradation ofsolution quality can be negligible.

A Kernel Search Algorithm for Virtual Machine Consolidation Problem