RO EN
A sensitivity measure of the Pareto set in a vector linfnity-extreme combinatorial problem
Authors: V.A. Emelichev, A.M. Leonovich
– 0.16 Mb
Abstract
We consider a vector minimization problem on system of subsets of finite set with Chebyshev norm in a space of perturbing parameters. The behavior of the Pareto set as a function of parameters of partial criteria of the kind MINMAX of absolute value is investigated.V.A. Emelichev, A.M. Leonovich,
Belorussian State University
ave. F.Skoriny, 4,
Minsk 220050 Belarus
e-mail:
Belorussian State University
ave. F.Skoriny, 4,
Minsk 220050 Belarus
e-mail:
Fulltext
– 0.16 Mb
Contents
- Algorithms for minimum flows
- A sensitivity measure of the Pareto set in a vector linfnity-extreme combinatorial problem
- Extremal gaps in BP3-designs
- The Multiobjective Bottleneck Transportation Problem
- Genetic algorithms for the synthesis optimization of a set of irredundant diagnostic tests in the intelligent system
- T-invariants for jumping Petri nets
- Non-commutative computer algebra and molecular computing
- Ekaterina Logvinovna Yushchenko (a tribute in her memory)
