Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty

DOI10.1007/S10559-016-9846-XzbMath1348.90543OpenAlexW2402031358MaRDI QIDQ334254

O. O. Iemets, T. M. Barbolina

Publication date: 1 November 2016

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

Full work available at URL: https://doi.org/10.1007/s10559-016-9846-x

zbMATH Keywords

stochastic optimizationoptimization on arrangementsEuclidian combinatorial optimization problemstochastic combinatorial optimizationstochastic uncertainty

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty
• On stochastic linear programming problems with the quantile criterion
• Combinatorial optimization model of packing rectangles with stochastic parameters
• Classification of applied methods of combinatorial optimization
• Predicting gene structure with the use of mixtures of probability distributions
• Systems analysis of robust strategic decisions to plan secure food, energy, and water provision based on the stochastic globiom model
• Method of ordering the values of a linear function on a set of permutations
• Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization

This page was built for publication: Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty