Combinatorial optimization under uncertainty

Authors:
O. A. Yemets;A. A. Roskladka
Affiliations:
University of Consumers' Cooperation, Poltava, Ukraine;University of Consumers' Cooperation, Poltava, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2008

Citing 8
Cited 1

Polytopes, graphs and optimisation

Polytopes, graphs and optimisation
Introduction to algorithms

Introduction to algorithms
Existence of Solutions in Vector Optimization Problems

Cybernetics and Systems Analysis
A Fuzzy Problem of Multiparametric Choice of Optimal Solutions

Cybernetics and Systems Analysis
Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints

Cybernetics and Systems Analysis
Solving optimization problems with linear-fractional objective functions and additional constraints on arrangements

Cybernetics and Systems Analysis
Linear variational principle for convex vector maximization

Cybernetics and Systems Analysis
Stability of a combinatorial vector partition problem

Cybernetics and Systems Analysis

Optimization Problems with Interval Uncertainty: Branch and Bound Method

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the general problem of Euclidean combinatorial optimization under uncertainty is formulated for the first time and the concepts of a stochastic multiset, a multiset of fuzzy numbers, a stochastic Euclidean combinatorial set, and general Euclidean combinatorial set of fuzzy stochastic numbers that combines the properties of both types of uncertainty are introduced.