Combinatorial optimization model of packing rectangles with stochastic parameters
From MaRDI portal
Publication:747306
DOI10.1007/S10559-015-9749-2zbMATH Open1327.90260OpenAlexW2338712433MaRDI QIDQ747306FDOQ747306
Authors: 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
Recommendations
combinatorial optimizationstochastic optimizationlinear orderdiscrete random variablepacking modelspacking of rectangles
Cites Work
- The complexity of cutting complexes
- Combinatorial optimization under uncertainty
- Optimization problems with interval uncertainty: branch and bound method
- Title not available (Why is that?)
- A fuzzy problem of multiparametric choice of optimal solutions
- A mathematical interval model of a combinatorial problem of packing of color rectangles
- Title not available (Why is that?)
Cited In (6)
- Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty
- Direct cut-off method for combinatorial optimization problems with additional constraints
- Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
- Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements
- Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty
- A mathematical interval model of a combinatorial problem of packing of color rectangles
This page was built for publication: Combinatorial optimization model of packing rectangles with stochastic parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747306)
