Single Facility Location: Circle Covering Problem, Sylvester's Problem

2012 ◽  
Keyword(s):  
Facility Location ◽  
Covering Problem ◽  
Sylvester’S Problem ◽  
Circle Covering ◽  
Single Facility

Single Facility Location: Circle Covering Problem

2008 ◽  
pp. 3607-3610
Author(s):  
Donald W. Hearn
Keyword(s):  
Facility Location ◽  
Covering Problem ◽  
Circle Covering ◽  
Single Facility

Single Facility Location: Circle Covering Problem

2006 ◽  
pp. 2398-2401
Author(s):  
Donald W. Hearn
Keyword(s):  
Facility Location ◽  
Covering Problem ◽  
Circle Covering ◽  
Single Facility

Integrated use of soft computing and clustering for capacitated clustering single-facility location problem with one-time delivery

2016 ◽  
Author(s):  
Yunzhi Jiang ◽  
Wei-Chang Yeh ◽  
Chyh-Ming Lai ◽  
Hsiu-Hao Liu ◽  
Che-Hou Yeh ◽  
...  
Keyword(s):  
Facility Location ◽  
Soft Computing ◽  
Location Problem ◽  
Facility Location Problem ◽  
Single Facility

Single-Facility Location Problems with Barriers

2002 ◽  
Author(s):  
Kathrin Klamroth
Keyword(s):  
Facility Location ◽  
Location Problems ◽  
Facility Location Problems ◽  
Single Facility

Data Mining for Multicriteria Single Facility Location Problems

2020 ◽  
pp. 1248-1271
Author(s):  
Seda Tolun ◽  
Halit Alper Tayalı
Keyword(s):  
Data Mining ◽  
Decision Analysis ◽  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Support Vector ◽  
Ranking Svm ◽  
Vector Machines ◽  
Single Facility

This chapter focuses on available data analysis and data mining techniques to find the optimal location of the Multicriteria Single Facility Location Problem (MSFLP) at diverse business settings. Solving for the optimal of an MSFLP, there exists numerous multicriteria decision analysis techniques. Mainstream models are mentioned in this chapter, while presenting a general classification of the MSFLP and its framework. Besides, topics from machine learning with respect to decision analysis are covered: Unsupervised Principal Components Analysis ranking (PCA-rank) and supervised Support Vector Machines ranking (SVM-rank). This chapter proposes a data mining perspective for the multicriteria single facility location problem and proposes a new approach to the facility location problem with the combination of the PCA-rank and ranking SVMs.

Covering Discs in Minkowski Planes

2009 ◽  
Vol 52 (3) ◽  
pp. 424-434 ◽  
Author(s):  
Horst Martini ◽  
Margarita Spirova
Keyword(s):  
Essential Role ◽  
Covering Problem ◽  
Minkowski Geometry ◽  
Minkowski Planes ◽  
Strictly Convex ◽  
Unit Circles ◽  
Circle Covering ◽  
Monotonicity Lemma

AbstractWe investigate the following version of the circle covering problem in strictly convex (normed or) Minkowski planes: to cover a circle of largest possible diameter by k unit circles. In particular, we study the cases k = 3, k = 4, and k = 7. For k = 3 and k = 4, the diameters under consideration are described in terms of side-lengths and circumradii of certain inscribed regular triangles or quadrangles. This yields also simple explanations of geometric meanings that the corresponding homothety ratios have. It turns out that basic notions from Minkowski geometry play an essential role in our proofs, namely Minkowskian bisectors, d-segments, and the monotonicity lemma.

scholarly journals Single facility location problems with unbounded unit balls

2003 ◽  
Vol 58 (1) ◽  
pp. 87-104 ◽  
Author(s):  
Y. Hinojosa ◽  
J. Puerto
Keyword(s):  
Facility Location ◽  
Location Problems ◽  
Facility Location Problems ◽  
Single Facility

GBSSS: The generalized big square small square method for planar single-facility location

1992 ◽  
Vol 62 (2) ◽  
pp. 163-174 ◽  
Author(s):  
Frank Plastria
Keyword(s):  
Facility Location ◽  
Single Facility

scholarly journals Uncertain models for single facility location problems on networks

2012 ◽  
Vol 36 (6) ◽  
pp. 2592-2599 ◽  
Author(s):  
Yuan Gao
Keyword(s):  
Facility Location ◽  
Location Problems ◽  
Facility Location Problems ◽  
Single Facility

An efficient method for single-facility location and path-connecting problems in a cell map

2013 ◽  
Vol 27 (10) ◽  
pp. 2060-2076 ◽  
Author(s):  
K. Y. Chang ◽  
C. M. Su ◽  
G. E. Jan ◽  
C. P. Chen
Keyword(s):  
Facility Location ◽  
Efficient Method ◽  
A Cell ◽  
Single Facility
Sign in / Sign up

Export Citation Format

Share Document