On determining the cover of a simplex by spheres centered at its vertices

被引：13

作者：

Casado, L. G. ^{[1
]}

Garcia, I. ^{[1
]}

Toth, B. G. ^{[2
]}

Hendrix, E. M. T. ^{[3
]}

机构：

[1] Univ Almeria, Comp Architecture & Elect Dept, Almeria 04120, Spain

[2] Budapest Univ Technol & Econ, Dept Differential Equat, H-1117 Budapest, Hungary

[3] Univ Malaga, Dept Comp Architecture, Malaga 29017, Spain

来源：

JOURNAL OF GLOBAL OPTIMIZATION | 2011年 / 50卷 / 04期

关键词：

Covering; Simplex; Spheres;

D O I：

10.1007/s10898-010-9524-x

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The aim of this work is to study the Simplex Cover (SC) problem, which is to determine whether a given simplex is covered by spheres centered at its vertices. We show that the SC problem is equivalent to a global optimization problem. We investigate its characteristics.

引用

页码：645 / 655

页数：11

共 6 条

[1] AURENHAMMER F, 1991, COMPUT SURV, V23, P345, DOI 10.1145/116873.116880
[2] EDELSBRUNNER H, 1993, SCG 93, P218
[3] An efficient algorithm for construction of the power diagram from the Voronoi diagram in the plane
Gavrilova, M
Rokne, J
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1996, 61 (1-2) : 49 - 61
[4] The semi-continuous quadratic mixture design problem:: Description and branch-and-bound approach
Hendrix, Eligius M. T.
Casado, Leocadio G.
Garcia, Inmaculada
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 191 (03) : 803 - 815
[5] SADRI B, 2006, THESIS U ILLINOIS UR
[6] Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
Toth, Boglarka
Casado, Leocadio G.
[J]. JOURNAL OF GLOBAL OPTIMIZATION, 2007, 38 (02) : 215 - 236

← 1 →