Abstract: The multicriterion problem of discrete optimization on the feasible combinatorial set of
polyarrangements is examined. Structural properties of feasible region and different types of efficient decisions
are explored. On the basis of development of ideas of Euclidean combinatorial optimization and method of
general criterion possible approaches for the solution of multicriterion combinatorial problem on the set of
polyrrangements is developed and substantiated.
Keywords: multicriterion optimization, discrete optimization, polyarrangements, Pareto-optimal solution, weakly
and strongly efficient solutions, combinatorial set of polyarrangements.
ACM Classification Keywords: G 2.1 Combinatorics (F2.2), G 1.6 Optimization
Link:
MULTICRITERION PROBLEMS
ON THE COMBINATORIAL SET OF POLYARRANGEMENTS
Natalia Semenova, Lyudmyla Kolechkina
http://foibg.com/ibs_isc/ibs-15/ibs-15-p15.pdf
Wiki
(1.00/10)
