Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: 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: Using Extra Dual Cuts to Accelerate Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new linearization technique for multi-quadratic 0-1 programming problems. / 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: A branch-and-price algorithm for the temporal bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Pseudo-polynomial Formulations 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: Solving multistatic sonar location problems with mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and computational study of several linearisation techniques for binary quadratic problems / 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: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Inequalities for Stabilized Column Generation Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables / 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: Allocating Bandwidth for Bursty Connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust approach to the chance-constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-stage stochastic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation / 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: Compact integer linear programming formulations for the temporal bin packing problem with fire-ups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linearization Procedure for Quadratic and Cubic Mixed-Integer 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: Optimal Bin Packing with Items of Random Sizes / 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: Branch-and-price algorithms for the one-dimensional cutting stock problem / rank
 
Normal rank

Latest revision as of 06:37, 28 July 2024

scientific article
Language Label Description Also known as
English
Mathematical models and approximate solution approaches for the stochastic bin packing problem
scientific article

    Statements

    Mathematical models and approximate solution approaches for the stochastic bin packing problem (English)
    0 references
    0 references
    0 references
    9 March 2022
    0 references
    cutting and packing
    0 references
    stochastic bin packing problem
    0 references
    lower bounds
    0 references
    heuristics
    0 references
    linearization
    0 references
    normal distribution
    0 references

    Identifiers