A cardinality constrained iterated local search for the virtual machine placement problem

DOI10.1016/J.COR.2025.107222MaRDI QIDQ6891489zbMATH OpenFDO

Authors Qing Zhou, Yuru Li, Jin-Kao Hao, Qinghua Wu, Yuning Chen

Publication date 2 December 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2025.107222

zbMATH Keywords

combinatorial optimizationlocal searchmetaheuristicsvirtual machine placement

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch-and-price algorithm for the temporal bin packing problem
• A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
• An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
• An adaptive multistart tabu search approach to solve the maximum clique problem
• An opposition-based memetic algorithm for the maximum quasi-clique problem
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Multi-objective temporal bin packing problem: an application in cloud computing
• Population-based iterated local search for batch scheduling on parallel machines with incompatible job families, release dates, and tardiness penalties
• Resource allocation algorithms for virtualized service hosting platforms
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• Tabu Search—Part I
• Virtual machine placement for minimizing connection cost in data center networks

This page was built for publication: A cardinality constrained iterated local search for the virtual machine placement problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891489)