Multivariate tests for the multi‐sample location problem based on depth function

Stat ◽  
2021 ◽  
Author(s):  
Sakineh Dehghan ◽  
Mohammad Reza Faridrohani
Keyword(s):  
Location Problem ◽  
Multivariate Tests ◽  
Depth Function

Establishment of multivariate reference range of P-wave amplitude based on depth function

2010 ◽  
Vol 30 (11) ◽  
pp. 1215-1217
Author(s):  
Jiu WANG ◽  
Hong-wei SUN ◽  
Yong GAO ◽  
Tian-he XU
Keyword(s):  
Wave Amplitude ◽  
Reference Range ◽  
P Wave ◽  
Depth Function

The Gradual Minimal Covering Location Problem

2020 ◽  
Author(s):  
Mostafa Khatami ◽  
Amir Salehipour
Keyword(s):  
Location Problem ◽  
Minimal Covering

Rank Based Genetic Algorithm for solving the Banking ATM's Location Problem using convolution

2011 ◽  
Author(s):  
Alaa Alhaffa ◽  
Omar Al Jadaan ◽  
Wael Abdulal ◽  
Ahmad Jabas
Keyword(s):  
Genetic Algorithm ◽  
Location Problem

The Multi-Commodity Facilities Location Problem

1981 ◽  
Vol 32 (9) ◽  
pp. 803 ◽  
Author(s):  
J. Karkazis ◽  
T. B. Boffey
Keyword(s):  
Location Problem ◽  
Facilities Location

Effects of gender-linked language differences in adults' written discourse: Multivariate tests of language effects

1994 ◽  
Vol 14 (3) ◽  
pp. 299-309 ◽  
Author(s):  
Anthony Mulac ◽  
Torborg Louisa Lundell
Keyword(s):  
Written Discourse ◽  
Multivariate Tests ◽  
Language Differences ◽  
Language Effects

scholarly journals Location Problem of Production and Sales under Carbon Tax Policy

2020 ◽  
Vol 1575 ◽  
pp. 012188
Author(s):  
Chong Xiang ◽  
Xiaoshen Li ◽  
Guanglei Sun
Keyword(s):  
Tax Policy ◽  
Location Problem ◽  
Carbon Tax

scholarly journals Dispersing Obnoxious Facilities on a Graph

Algorithmica ◽  
2021 ◽  
Author(s):  
Alexander Grigoriev ◽  
Tim A. Hartmann ◽  
Stefan Lendl ◽  
Gerhard J. Woeginger
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Unit Length ◽  
Facility Location Problem ◽  
Np Hard ◽  
Obnoxious Facilities ◽  
Rational Parameter ◽  
Polynomially Solvable

AbstractWe study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many facilities as possible subject to the condition that any two facilities have at least distance $$\delta$$ δ from each other. We investigate the complexity of this problem in terms of the rational parameter $$\delta$$ δ . The problem is polynomially solvable, if the numerator of $$\delta$$ δ is 1 or 2, while all other cases turn out to be NP-hard.

Sign in / Sign up

Export Citation Format

Share Document