An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11750-021-00613-1
+Normal rank
@@ Property / OpenAlex ID @@
+W3193659442
@@ Property / OpenAlex ID: W3193659442 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-objective temporal bin packing problem: an application in cloud computing
+Normal rank
@@ Property / cites work @@
+A Primer on Statistical Distributions
@@ Property / cites work: A Primer on Statistical Distributions / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
+Normal rank
@@ Property / cites work @@
+Bin packing and related problems: general arc-flow formulation with graph compression
+Normal rank
@@ Property / cites work @@
+Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
+Normal rank
@@ Property / cites work @@
+Q3347319
@@ Property / cites work: Q3347319 / rank @@
+Normal rank
@@ Property / cites work @@
+An Application of Bin-Packing to Multiprocessor Scheduling
+Normal rank
@@ Property / cites work @@
+A stochastic model of bin-packing
@@ Property / cites work: A stochastic model of bin-packing / rank @@
+Normal rank
@@ Property / cites work @@
+A Stochastic Model for Estimating the Power Consumption of a Processor
+Normal rank
@@ Property / cites work @@
+A branch-and-price algorithm for the temporal bin packing problem
+Normal rank
@@ Property / cites work @@
+Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
+Normal rank
@@ Property / cites work @@
+Bin packing and cutting stock problems: mathematical models and exact algorithms
+Normal rank
@@ Property / cites work @@
+Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
+Normal rank
@@ Property / cites work @@
+A New Linear Programming Approach to the Cutting Stock Problem
+Normal rank
@@ Property / cites work @@
+Theoretical and computational study of several linearisation techniques for binary quadratic problems
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
+Normal rank
@@ Property / cites work @@
+Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables
+Normal rank
@@ Property / cites work @@
+Mathematical Methods of Organizing and Planning Production
+Normal rank
@@ Property / cites work @@
+A Stochastic Programming Model
@@ Property / cites work: A Stochastic Programming Model / rank @@
+Normal rank
@@ Property / cites work @@
+Allocating Bandwidth for Bursty Connections
@@ Property / cites work: Allocating Bandwidth for Bursty Connections / rank @@
+Normal rank
@@ Property / cites work @@
+A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
+Normal rank
@@ Property / cites work @@
+Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
+Normal rank
@@ Property / cites work @@
+Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
+Normal rank
@@ Property / cites work @@
+Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
+Normal rank
@@ Property / cites work @@
+Q4138133
@@ Property / cites work: Q4138133 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact solution of bin-packing problems using column generation and branch-and-bound
+Normal rank
@@ Property / cites work @@
+LP models for bin packing and cutting stock problems
+Normal rank
@@ Property / cites work @@
+Branch-and-price algorithms for the one-dimensional cutting stock problem
+Normal rank
@@ Property / cites work @@
+Solving binary cutting stock problems by column generation and branch- and-bound
+Normal rank
@@ Property / cites work @@
+A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2146367