ALGORITHM FOR MAXIMIZING A LINEAR FUNCTION ON THE SET OF INTEGRAL POINTS OF A CONVEX POLYHEDRON

被引：0

|

作者：

TYU, NN

机构：

来源：

CYBERNETICS | 1986年 / 22卷 / 05期

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

收藏

页码：622 / 627

页数：6

相关论文

共 50 条

[21] AN ALGORITHM FOR FINDING THE CHEBYSHEV CENTER OF A CONVEX POLYHEDRON
BOTKIN, ND
TUROVABOTKINA, VL
APPLIED MATHEMATICS AND OPTIMIZATION, 1994, 29 (02): : 211 - 222
[22] Algorithm for three dimensional convex hull creation of a set of spatial points
Li, Qingquan
Li, Deren
Wuhan Cehui Keji Daxue Xuebao/Journal of Wuhan Technical University of Surveying and Mapping, 23 (02): : 121 - 123
[23] Maximizing the ratio of two convex functions over a convex set
Benson, HP
NAVAL RESEARCH LOGISTICS, 2006, 53 (04) : 309 - 317
[24] AN ALGORITHM FOR DETERMINING THE MINIMAL CONVEX SUBSET THAT CONTAINS ALL THE INTEGER POINTS OF A CONVEX POLYHEDRAL SET
HUGHES, JB
MATHEMATICAL AND COMPUTER MODELLING, 1994, 20 (09) : 111 - 118
[25] MINIMIZATION OF A CONCAVE FUNCTION ON A BOUNDED CONVEX POLYHEDRON
BALI, SG
OPERATIONS RESEARCH, 1975, 23 : B344 - B344
[26] How to find the convex hull of all integer points in a polyhedron?
Semenov, S. O.
Zolotykh, N. Yu.
OPTIMIZATION LETTERS, 2022, 16 (07) : 2177 - 2189
[27] How to find the convex hull of all integer points in a polyhedron?
S. O. Semenov
N. Yu. Zolotykh
Optimization Letters, 2022, 16 : 2177 - 2189
[28] A LINEAR SET OF INFINITE MEASURE WITH NO 2 POINTS HAVING INTEGRAL RATIO
HAIGHT, JA
MATHEMATIKA, 1970, 17 (33) : 133 - &
[29] Computing the Integer Points of a Polyhedron, I: Algorithm
Jing, Rui-Juan
Maza, Marc Moreno
COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, CASC 2017, 2017, 10490 : 225 - 241
[30] MINIMIZATION OF CONVEX SEPARABLE FUNCTION ON THE BASIC POLYHEDRON OF SUBMODULAR FUNCTION
PISARUK, NN
SOBOLEVSKAYA, EP
DOKLADY AKADEMII NAUK BELARUSI, 1993, 37 (05): : 19 - 23

← 1 2 3 4 5 →