Covering a simplex by spheres: complexity and algorithms

Simplex covering optimization problem (SCO) is modeled from the application of covering a simplex by m given balls. It contains the maximin dispersion problem as a special case. In this paper, we prove that (SCO) is NP-hard. We present an enumeration method (EM) to globally solve (SCO) and show that...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 84; číslo 1; s. 119 - 135
Hlavní autori:	Zhang, Tongli, Xia, Yong
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.09.2022 Springer Springer Nature B.V
Predmet:	Algorithms Analysis Complexity Computer Science Enumeration Experiments Linear programming Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Real Functions 90C20 NP-hard Maximin dispersion 90C26 90C47 Simplex covering
ISSN:	0925-5001, 1573-2916
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!