An introduction to stochastic bin packing-based server consolidation with conflicts
DOI10.1007/S11750-021-00613-1zbMATH Open1489.90159OpenAlexW3193659442MaRDI QIDQ2146367FDOQ2146367
Authors: J. Martinovic, Markus Hähnel, Guntram Scheithauer, Waltenegus Dargie 
Publication date: 16 June 2022
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-021-00613-1
Recommendations
- An integer programming approach to resource allocation in large-scale server consoldation
- Mathematical models and approximate solution approaches for the stochastic bin packing problem
- Algorithms for energy conservation in heterogeneous data centers
- Using matrix approximation for high-dimensional discrete optimization problems: server consolidation based on cyclic time-series data
- Optimising for energy or robustness? Trade-offs for VM consolidation in virtualized datacenters under uncertainty
Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Integer programming (90C10) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- A Primer on Statistical Distributions
- A Linear Programming Approach to the Cutting-Stock Problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Exact solution of bin-packing problems using column generation and branch-and-bound
- LP models for bin packing and cutting stock problems
- An Application of Bin-Packing to Multiprocessor Scheduling
- Title not available (Why is that?)
- Allocating Bandwidth for Bursty Connections
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Solving binary cutting stock problems by column generation and branch- and-bound
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- A New Linear Programming Approach to the Cutting Stock Problem
- A Stochastic Programming Model
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- A stochastic model of bin-packing
- A Stochastic Model for Estimating the Power Consumption of a Processor
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables
- Title not available (Why is that?)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
- A branch-and-price algorithm for the temporal bin packing problem
- Multi-objective temporal bin packing problem: an application in cloud computing
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Cited In (2)
This page was built for publication: An introduction to stochastic bin packing-based server consolidation with conflicts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146367)
