Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty
From MaRDI portal
Publication:315017
DOI10.1007/s10559-016-9825-2zbMath1346.90704OpenAlexW2318227382MaRDI QIDQ315017
Publication date: 19 September 2016
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-016-9825-2
discrete random variableEuclidean combinatorial optimization problemoptimization on arrangementsprobabilistic uncertainty
Related Items
Optimal search for locally feasible solutions of a linear function on permutations ⋮ Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty ⋮ Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Optimization problems with interval uncertainty: branch and bound method
- Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence
- On stochastic linear programming problems with the quantile criterion
- Combinatorial optimization model of packing rectangles with stochastic parameters
- Combinatorial optimization under uncertainty
- Method of ordering the values of a linear function on a set of permutations
- Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements
