Combinatorial optimization model of packing rectangles with stochastic parameters

DOI10.1007/s10559-015-9749-2zbMath1327.90260OpenAlexW2338712433MaRDI QIDQ747306

O. O. Iemets, T. M. Barbolina

Publication date: 23 October 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-015-9749-2

zbMATH Keywords

stochastic optimizationcombinatorial optimizationlinear orderdiscrete random variablepacking modelspacking of rectangles

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (5)

Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty ⋮ Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty ⋮ Direct cut-off method for combinatorial optimization problems with additional constraints ⋮ Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements ⋮ Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization problems with interval uncertainty: branch and bound method
• Combinatorial optimization under uncertainty
• The complexity of cutting complexes
• A mathematical interval model of a combinatorial problem of packing of color rectangles
• A fuzzy problem of multiparametric choice of optimal solutions

This page was built for publication: Combinatorial optimization model of packing rectangles with stochastic parameters