Algorithmic solution of two parametric optimization problems on a set of complete combinations

被引：1

作者：

Yemets, OA ^{[1
]}

Roskladka, AA ^{[1
]}

机构：

[1] State Tech Univ, Poltava, Ukraine

来源：

CYBERNETICS AND SYSTEMS ANALYSIS | 1999年 / 35卷 / 06期

关键词：

discrete-optimization problem; multiset; objective function; parametric analysis;

D O I：

10.1007/BF02742292

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Algorithmic solutions of parametric problems of two types (with a parameter in the objective function and with a parameter in the constraints) are considered in a Euclidean combinatorial set of combinations with repetitions.

引用

页码：981 / 986

页数：6

共 17 条

[1]

Aigner M., 1982, COMBINATORIAL THEORY

[2]

BARANOV VI, 1989, EXTREMAL COMBINATORI

[3]

EMELICHEV VA, 1995, KIBERN SIST ANAL, P137

[4]

Emets O. O., 1993, THEORY METHODS EUCLI

[5]

Gordeev E. N., 1984, Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, V24, P37

[6]

Gordeev E. N., 1996, ZH VYCH MAT MAT FIZ, V36, P66

[7]

Kozeratskaya L.N., 1983, KIBERNETIKA, P71

[8]

Kozeratskaya L. N., 1993, KIBERN SIST ANAL, P78

[9]

KOZERATSKAYA LN, 1997, INTEGER OPTIMIZATION

[10]

KOZERATSKAYA LN, 1995, OB PRIKL PROMYSH MAT, P12

← 1 2 →