Combinatorial optimization model of packing rectangles with stochastic parameters
From MaRDI portal
Publication:747306
Recommendations
Cites work
- scientific article; zbMATH DE number 42579 (Why is no real title available?)
- scientific article; zbMATH DE number 2169442 (Why is no real title available?)
- A fuzzy problem of multiparametric choice of optimal solutions
- A mathematical interval model of a combinatorial problem of packing of color rectangles
- Combinatorial optimization under uncertainty
- Optimization problems with interval uncertainty: branch and bound method
- The complexity of cutting complexes
Cited in
(6)- Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements
- 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 unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty
- Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
- 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)