Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10288-018-0384-4 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10288-018-0384-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2883279796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3160276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primer on Statistical Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and related problems: general arc-flow formulation with graph compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Model for Estimating the Power Consumption of a Processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP models for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Linear Programming Approach to the Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why Is the Sum of Independent Normal Random Variables Normal? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation for scheduling on uniform nonsimultaneous parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Methods of Organizing and Planning Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic generalized bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of scheduling with fixed jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modified integer round-up property of the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving binary cutting stock problems by column generation and branch- and-bound / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129494472 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10288-018-0384-4 / rank
 
Normal rank

Latest revision as of 17:45, 16 December 2024

scientific article
Language Label Description Also known as
English
Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
scientific article

    Statements

    Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 July 2019
    0 references
    cutting and packing
    0 references
    server consolidation
    0 references
    normal distribution
    0 references
    nondeterministic item lengths
    0 references
    integer programming
    0 references
    HAEC
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references