Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds
DOI10.1016/j.ejor.2016.11.003zbMath1402.90215OpenAlexW2547758711MaRDI QIDQ1751896
Jean-François Cordeau, Bjørn Nygreen, Lars Magnus Hvattum, Anders N. Gullhav
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11250/2423249
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Internet topics (68M11)
Related Items (9)
Uses Software
Cites Work
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- A branch and price approach for deployment of multi-tier software services in clouds
- Computational intelligence in reliability engineering. Evolutionary techniques in reliability analysis and optimization
- A general heuristic for vehicle routing problems
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Record breaking optimization results using the ruin and recreate principle
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
- Variable neighborhood search: Principles and applications
This page was built for publication: Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds